This survey presents a comprehensive review of vari-ous methods and algorithms related to passing-through control of multi-robot systems in cluttered environments.Numerous studies have investigated this area,and we id...This survey presents a comprehensive review of vari-ous methods and algorithms related to passing-through control of multi-robot systems in cluttered environments.Numerous studies have investigated this area,and we identify several avenues for enhancing existing methods.This survey describes some models of robots and commonly considered control objec-tives,followed by an in-depth analysis of four types of algo-rithms that can be employed for passing-through control:leader-follower formation control,multi-robot trajectory planning,con-trol-based methods,and virtual tube planning and control.Fur-thermore,we conduct a comparative analysis of these tech-niques and provide some subjective and general evaluations.展开更多
The problem of allocating a number of exploration tasks to a team of mobile robots in dynamic environments was studied. The team mission is to visit several distributed targets. The path cost of target is proportional...The problem of allocating a number of exploration tasks to a team of mobile robots in dynamic environments was studied. The team mission is to visit several distributed targets. The path cost of target is proportional to the distance that a robot has to move to visit the target. The team objective is to minimize the average path cost of target over all targets. Finding an optimal allocation is strongly NP-hard. The proposed algorithm can produce a near-optimal solution to it. The allocation can be cast in terms of a multi-round single-item auction by which robots bid on targets. In each auction round, one target is assigned to a robot that produces the lowest path cost of the target. The allocated targets form a forest where each tree corresponds a robot’s exploring targets set. Each robot constructs an exploring path through depth-first search in its target tree. The time complexity of the proposed algorithm is polynomial. Simulation experiments show that the allocating method is valid.展开更多
A new coordination scheme for multi-robot systems is proposed. A state space model of the multi- robot system is defined and constructed in which the system＇s initial and goal states are included along with the task ...A new coordination scheme for multi-robot systems is proposed. A state space model of the multi- robot system is defined and constructed in which the system＇s initial and goal states are included along with the task definition and the system＇s internal and external constraints. Task accomplishment is considered a transition of the system state in its state space （SS） under the system＇s constraints. Therefore, if there exists a connectable path within reachable area of the SS from the initial state to the goal state, the task is realizable. The optimal strategy for the task realization under constraints is investigated and reached by searching for the optimal state transition trajectory of the robot system in the SS. Moreover, if there is no connectable path, which means the task cannot be performed Successfully, the task could be transformed to be realizable by making the initial state and the goal state connectable and finding a path connecting them in the system＇s SS. This might be done via adjusting the system＇s configuration and/or task constraints. Experiments of multi-robot formation control with obstacles in the environment are conducted and simulation results show the validity of the proposed method.展开更多
Analysis and design techniques for cooperative flocking of nonholonomic multi-robot systems with connectivity maintenance on directed graphs are presented. First, a set of bounded and smoothly distributed control prot...Analysis and design techniques for cooperative flocking of nonholonomic multi-robot systems with connectivity maintenance on directed graphs are presented. First, a set of bounded and smoothly distributed control protocols are devised via carefully designing a class of bounded artificial potential fields （APF） which could guarantee the connectivity maintenance, col ision avoidance and distance stabilization simultaneously during the system evolution. The connectivity of the underlying network can be preserved, and the desired stable flocking behavior can be achieved provided that the initial communication topology is strongly connected rather than undirected or balanced, which relaxes the constraints for group topology and extends the previous work to more generalized directed graphs. Furthermore, the proposed control algorithm is extended to solve the flocking problem with a virtual leader. In this case, it is shown that al robots can asymptotically move with the desired velocity and orientation even if there is only one informed robot in the team. Finally, nontrivial simulations and experiments are conducted to verify the effectiveness of the proposed algorithm.展开更多
文摘This survey presents a comprehensive review of vari-ous methods and algorithms related to passing-through control of multi-robot systems in cluttered environments.Numerous studies have investigated this area,and we identify several avenues for enhancing existing methods.This survey describes some models of robots and commonly considered control objec-tives,followed by an in-depth analysis of four types of algo-rithms that can be employed for passing-through control:leader-follower formation control,multi-robot trajectory planning,con-trol-based methods,and virtual tube planning and control.Fur-thermore,we conduct a comparative analysis of these tech-niques and provide some subjective and general evaluations.
基金Project(A1420060159) supported by the National Basic Research of China projects(60234030 60404021) supported bythe National Natural Science Foundation of China
文摘The problem of allocating a number of exploration tasks to a team of mobile robots in dynamic environments was studied. The team mission is to visit several distributed targets. The path cost of target is proportional to the distance that a robot has to move to visit the target. The team objective is to minimize the average path cost of target over all targets. Finding an optimal allocation is strongly NP-hard. The proposed algorithm can produce a near-optimal solution to it. The allocation can be cast in terms of a multi-round single-item auction by which robots bid on targets. In each auction round, one target is assigned to a robot that produces the lowest path cost of the target. The allocated targets form a forest where each tree corresponds a robot’s exploring targets set. Each robot constructs an exploring path through depth-first search in its target tree. The time complexity of the proposed algorithm is polynomial. Simulation experiments show that the allocating method is valid.
基金the National Natural Science Foundation of China (60428303).
文摘A new coordination scheme for multi-robot systems is proposed. A state space model of the multi- robot system is defined and constructed in which the system＇s initial and goal states are included along with the task definition and the system＇s internal and external constraints. Task accomplishment is considered a transition of the system state in its state space （SS） under the system＇s constraints. Therefore, if there exists a connectable path within reachable area of the SS from the initial state to the goal state, the task is realizable. The optimal strategy for the task realization under constraints is investigated and reached by searching for the optimal state transition trajectory of the robot system in the SS. Moreover, if there is no connectable path, which means the task cannot be performed Successfully, the task could be transformed to be realizable by making the initial state and the goal state connectable and finding a path connecting them in the system＇s SS. This might be done via adjusting the system＇s configuration and/or task constraints. Experiments of multi-robot formation control with obstacles in the environment are conducted and simulation results show the validity of the proposed method.
基金supported by the National Natural Science Foundation of China(61175112)the Foundation for Innovative Research Groups of the National Natural Science Foundation of China(G61321002)+3 种基金the Projects of Major International(Regional)Joint Research Program(61120106010)the Beijing Education Committee Cooperation Building Foundationthe Program for Changjiang Scholars and Innovative Research Team in University(IRT1208)the ChangJiang Scholars Program and the Beijing Outstanding Ph.D.Program Mentor Grant(20131000704)
文摘Analysis and design techniques for cooperative flocking of nonholonomic multi-robot systems with connectivity maintenance on directed graphs are presented. First, a set of bounded and smoothly distributed control protocols are devised via carefully designing a class of bounded artificial potential fields （APF） which could guarantee the connectivity maintenance, col ision avoidance and distance stabilization simultaneously during the system evolution. The connectivity of the underlying network can be preserved, and the desired stable flocking behavior can be achieved provided that the initial communication topology is strongly connected rather than undirected or balanced, which relaxes the constraints for group topology and extends the previous work to more generalized directed graphs. Furthermore, the proposed control algorithm is extended to solve the flocking problem with a virtual leader. In this case, it is shown that al robots can asymptotically move with the desired velocity and orientation even if there is only one informed robot in the team. Finally, nontrivial simulations and experiments are conducted to verify the effectiveness of the proposed algorithm.
