Zobrazeno 1 - 10
of 29
pro vyhledávání: '"Tony A. Wood"'
Publikováno v:
IEEE Robotics and Automation Letters. 5:5693-5700
Traditional task assignment approaches for multi-agent motion control do not take the possibility of collisions into account. This can lead to challenging requirements for path planning. We derive an assignment method that not only minimises the larg
Autor:
Moritz Diehl, Tony A. Wood, David J. Olinger, Sebastian Rapp, Roy S. Smith, Rachel Leuthold, Michael A. Demetriou, Lorenzo Fagiano, Roland Schmehl, Chris Vermillion, Mitchell Cobb
Publikováno v:
Annual reviews in control, 52
Airborne wind energy systems convert wind energy into electricity using tethered flying devices, typically flexible kites or aircraft. Replacing the tower and foundation of conventional wind turbines can substantially reduce the material use and, con
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bec7752b792192e3baec6b6a064bc7da
https://hdl.handle.net/20.500.11850/520655
https://hdl.handle.net/20.500.11850/520655
We develop an algorithm to solve the Bottleneck Assignment Problem (BAP) that is amenable to having computation distributed over a network of agents. This consists of exploring how each component of the algorithm can be distributed, with a focus on o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e607af74176945122f3ad706331d4f70
http://arxiv.org/abs/2011.09606
http://arxiv.org/abs/2011.09606
An assignment problem arises when there exists a set of tasks that must be allocated to a set of agents. The bottleneck assignment problem (BAP) has the objective of minimising the most costly allocation of a task to an agent. Under certain condition
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::95d5fd86eab00c965e60244c820b858c
http://arxiv.org/abs/2008.10804
http://arxiv.org/abs/2008.10804
Publikováno v:
ACC
In this paper, the following question is addressed: given a linear assignment problem, how much can the all of the individual assignment weights be perturbed without changing the optimal assignment? The extension of results involving perturbations in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7c33bae52b35d08f36c6199cf5a53a7c
http://arxiv.org/abs/2005.11792
http://arxiv.org/abs/2005.11792
Publikováno v:
ECC
We examine the robustness of bottleneck assignment problems to perturbations in the assignment weights. We derive two algorithms that provide uncertainty bounds for robust assignment. We prove that the bottleneck assignment is guaranteed to be invari
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9d935d1f2f5ca5dacae52cb3b9953eb6
Publikováno v:
IFAC-PapersOnLine, 51 (15)
18th IFAC Symposium on System Identification, SYSID 2018. Proceedings
IFAC-Papers
18th IFAC Symposium on System Identification, SYSID 2018. Proceedings
IFAC-Papers
Large-scale kites, flying high-force crosswind trajectories, have been proposed for wind power generation. A two phase operational cycle generates net positive power using a ground-based motor/generator. In the traction phase the kite flies a high-fo
Publikováno v:
IEEE Control Systems Letters
We consider robust control synthesis for linear systems with complex specifications that are affected by uncertain disturbances. This letter is motivated by autonomous systems interacting with partially known, time-varying environments. Given a speci
Publikováno v:
IFAC-PapersOnLine. 50:11959-11964
We present a novel estimation approach for airborne wind energy systems with ground-based control and energy generation. The estimator fuses measurements from an inertial measurement unit attached to a tethered wing and position measurements from a c
Publikováno v:
CDC
Assignment problems are found in multiagent systems, where there is a need to allocate multiple tasks to agents. The bottleneck assignment problem (BAP) is an assignment problem where the objective is to minimise the worst individual cost in the assi