3 accepted papers
This study seeks towards a better understanding of multi-vehicle routing problems (VRPs) under restricted observability. Unlike most prior research that assumes full knowledge of tasks and vehicles, this paper addresses VRPs where each vehicle’s observation is confined to the k-nearest neighbourhood…
This study presents a recursive algorithm for solving the regularised least squares problem for online identification of rigid body dynamic model parameters with emphasis on the physical consistency of estimated inertial parameters. One of the geometric approaches is to use a regulariser that repres…
In this paper we present a decentralised algorithm to solve the Task Allocation problem. Given a set of tasks and a set of robots each with its own utility function, this problem concerns the non-overlapping allocation of tasks to agents maximising the sum of the robot's utility functions. Our algor…