Article

Localization for Multirobot Formations in Indoor Environment

Joint Adv. Res. Center, City Univ. of Hong Kong, Kowloon, China
IEEE/ASME Transactions on Mechatronics (Impact Factor: 3.14). 09/2010; DOI: 10.1109/TMECH.2009.2030584
Source: IEEE Xplore

ABSTRACT Localization is a key issue in multirobot formations, but it has not yet been sufficiently studied. In this paper, we propose a ceiling vision-based simultaneous localization and mapping (SLAM) methodology for solving the global localization problems in multirobot formations. First, an efficient data-association method is developed to achieve an optimistic feature match hypothesis quickly and accurately. Then, the relative poses among the robots are calculated utilizing a match-based approach, for local localization. To achieve the goal of global localization, three strategies are proposed. The first strategy is to globally localize one robot only (i.e., leader) and then localize the others based on relative poses among the robots. The second strategy is that each robot globally localizes itself by implementing SLAM individually. The third strategy is to utilize a common SLAM server, which may be installed on one of the robots, to globally localize all the robots simultaneously, based on a shared global map. Experiments are finally performed on a group of mobile robots to demonstrate the effectiveness of the proposed approaches.

0 Bookmarks
 · 
121 Views
  • [Show abstract] [Hide abstract]
    ABSTRACT: Maintaining the connectivity of an underlying robot network during a rendezvous task in the presence of obstacles is a challenge in control systems technology. In this brief, a navigation-function-based potential field approach is developed to address this challenging problem. A concept called connectivity constraint is used to establish a navigation function. A new potential field that simultaneously integrates rendezvous requirement, connectivity maintenance, and obstacle avoidance is also developed. On the basis of this potential field, we design a bounded control input for multirobot control. The proposed controller can drive multiple robots to an agreement state while maintaining connectivity of the underlying network provided that the initial configurations of the robots are connected. Simulations and experiments are performed to verify the effectiveness of the proposed approach.
    IEEE Transactions on Control Systems Technology 01/2013; 21(6):2306-2314. · 2.52 Impact Factor
  • [Show abstract] [Hide abstract]
    ABSTRACT: This paper presents a distributed control approach to shape control of a multirobot group. Upon definition of the desired region that robots converge to, a multilevel based topology is designed within the desired region, and formations of different shapes can be constructed using the proposed topology. A market based auction algorithm is further developed to drive the robot group towards particular positions inside the desired region to form the desired shape. Simulations results are shown to demonstrate the effectiveness of the proposed approach.
    Robotics and Biomimetics (ROBIO), 2012 IEEE International Conference on; 01/2012
  • [Show abstract] [Hide abstract]
    ABSTRACT: We propose a coalition-based approach to solve the task allocation problem of multiple robots with resource constraints. The resources required by task execution characterize the robots and tasks. Robots must form coalitions to accomplish the assigned tasks because individually, each robot may not complete the task independently due to resource limitation. We consider both online and offline assignment manners of the task allocation problem. For online assignment, a sequential coalition method is proposed to select efficiently the suitable robots to form coalitions for the assigned task. For offline assignment, a holistic coalition method is proposed for global optimization of all the assigned tasks. Both sequential and holistic coalition methods are compared with existing approaches. Numerous simulations and experiments performed on heterogeneous multiple mobile robots demonstrate the effectiveness of the proposed coalition-based task allocation methods. Note to Practitioners - Task allocation into a group of heterogeneous mobile robots for implementing multiple tasks is a challenge in multirobot applications. To find and organize the most suitable coalition for each task, we need to well organize the coalition for each task to maximize the robot group utility and optimize the task allocation solution. The sequential and holistic coalition methods presented in this paper provide both online and offline solutions for optimal multirobot task allocation. The advantage of the sequential coalition method lies in its efficiency in selecting best-fitted robots during coalition forming, and the advantage of the holistic coalition method lies in its effectiveness in finding the global optimal solution for all tasks. We illustrate the effectiveness of the proposed methods through numerous case studies with comparisons in this paper.
    IEEE Transactions on Automation Science and Engineering 01/2012; 9(3):516-528. · 1.67 Impact Factor