Robustness is key to engineering, automation, and science as a whole. However, the
property of robustness is often underpinned by costly requirements such as over …

Previous work on assigning tasks to robots has proposed extensive categorizations of
allocation of tasks with and without constraints. The main contribution of this paper is a …

As the need for autonomous reconnaissance and surveillance missions in cluttered urban
environments has been increasing, this paper describes a cooperative path planning …

The multiple traveling salesman problem (MTSP) is an important combinatorial optimization
problem. It has been widely and successfully applied to the practical cases in which multiple …

The design and structure of a self-assembly modular robot (Sambot) are presented in this
paper. Each module has its own autonomous mobility and can connect with other modules …

Various ambient assisted living (AAL) technologies have been proposed for improving the
living conditions of elderly people. One of them is to introduce robots to reduce dependency …

Ad-hoc aerial sensor networks leveraging MUAVs (Micro Unmanned Aerial Vehicles) are
ideally suited to cost-efficiently explore unknown or hostile environments for example in …

A colored traveling salesman problem (CTSP) is a generalization of the well-known multiple
traveling salesman problem. This paper investigate a class of CTSP, called serial CTSP (S …

We present empirical results of an auction-based algorithm for dynamic allocation of tasks to
robots. The results have been obtained both in simulation and using real robots. A distinctive …

Mobile robots are increasingly being deployed to replace humans in hazardous
environments, and optimizing the task assignment among robots can produce satisfactory …