Real-time obstacle avoidance for manipulators and mobile robots
International Journal of Robotics Research
Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
Designing emergent behaviors: from local interactions to collective intelligence
Proceedings of the second international conference on From animals to animats 2 : simulation of adaptive behavior: simulation of adaptive behavior
Applications of a logic of knowledge to motion planning under uncertainty
Journal of the ACM (JACM)
Robot colonies
An Behavior-based Robotics
Robot Motion Planning
Distributed Autonomous Robotic Systems
Distributed Autonomous Robotic Systems
Distributed Autonomous Robotic Systems 3
Distributed Autonomous Robotic Systems 3
Distributed Autonomous Robotic Systems 4
Distributed Autonomous Robotic Systems 4
Cellular Robotics and Micro Robotics Systems
Cellular Robotics and Micro Robotics Systems
A directional diffusion algorithm on cellular automata for robot path-planning
Future Generation Computer Systems - Cellular automata CA 2000 and ACRI 2000
Journal of Intelligent and Robotic Systems
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Hi-index | 0.00 |
The assignment of distributed mobile autonomous robots to targets, which occurs for instance as an important task in flexible manufacturing environments, is solved by using a self-organization approach motivated by pattern formation principles in biological, chemical, and physical systems. Similar to observations in many natural systems, such as ant tribes, the pattern formation of colored shells or convection patterns in the Rayleigh-Bénard problem of fluid dynamics, the self-organization principles lead to a robust and fault tolerant behavior where the patterns or structures recover from disturbances. The considered problem is the dynamic assignment of a number of robots to given targets where the mobile robots have to move to the targets in order to perform some tasks there. Hereby, each robot uses only local information (i.e., no world coordinate system is necessary). The underlying mathematical problem of the robot-target assignment is the so-called two-index assignment problem from combinatorial optimization. The approach used guarantees always feasible solutions in the assignment of robotic units to targets. As a consequence, for scenarios with only convex obstacles with large enough distances to each other, no spurious states cause the assignment process to fail. The error resistant control method for distributed autonomous robotic systems is demonstrated by several experiments with mobile robots. These results are compared and supplemented with computer simulations.