Zobrazeno 1 - 10
of 341
pro vyhledávání: '"Wood, Tony A."'
We consider the problem of finding a low-cost allocation and ordering of tasks between a team of robots in a d-dimensional, uncertain, landscape, and the sensitivity of this solution to changes in the cost function. Various algorithms have been shown
Externí odkaz:
http://arxiv.org/abs/2306.16032
Autor:
Wood, Tony A., Kamgarpour, Maryam
Minimising the longest travel distance for a group of mobile robots with interchangeable goals requires knowledge of the shortest length paths between all robots and goal destinations. Determining the exact length of the shortest paths in an environm
Externí odkaz:
http://arxiv.org/abs/2212.12724
With advances in image processing and machine learning, it is now feasible to incorporate semantic information into the problem of simultaneous localisation and mapping (SLAM). Previously, SLAM was carried out using lower level geometric features (po
Externí odkaz:
http://arxiv.org/abs/2202.12802
In this paper, we consider the optimisation of a time varying scalar field by a network of agents with no gradient information. We propose a composite control law, blending extremum seeking with formation control in order to converge to the extrema f
Externí odkaz:
http://arxiv.org/abs/2201.00446
Reusable decoys offer a cost-effective alternative to the single-use hardware commonly applied to protect surface assets from threats. Such decoys portray fake assets to lure threats away from the true asset. To deceive a threat, a decoy first has to
Externí odkaz:
http://arxiv.org/abs/2106.09252
In assignment problems, decision makers are often interested in not only the optimal assignment, but also the sensitivity of the optimal assignment to perturbations in the assignment weights. Typically, only perturbations to individual assignment wei
Externí odkaz:
http://arxiv.org/abs/2104.00803
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:
http://arxiv.org/abs/2011.09606
Solving the Lexicographic Bottleneck Assignment Problem (LexBAP) typically relies on centralised computation with order quartic complexity. We consider the Sequential Bottleneck Assignment Problem (SeqBAP), which yields a greedy solution to the LexBA
Externí odkaz:
http://arxiv.org/abs/2008.12508
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:
http://arxiv.org/abs/2008.10804
In this paper, we consider the optimisation of time varying functions by a network of agents with no gradient information. The proposed a novel method to estimate the gradient at each agent's position using only neighbour information. The gradient es
Externí odkaz:
http://arxiv.org/abs/2007.15680