coordinated path planning
Recently Published Documents


TOTAL DOCUMENTS

14
(FIVE YEARS 2)

H-INDEX

6
(FIVE YEARS 0)

Author(s):  
Xingjuan CAI ◽  
Zhaoming HU ◽  
Zhixia ZHANG ◽  
Qian WANG ◽  
Zhihua CUI ◽  
...  

Author(s):  
Keerthi Sagar ◽  
Dimiter Zlatanov ◽  
Matteo Zoppi ◽  
Cristiano Nattero ◽  
Sreekumar Muthuswamy

The paper addresses the coordinated path planning of mobile agents with multiple goal positions and orientations in a plane. The targeted multi-robot system uses discrete locomotion ensuring uncertainty-free localization and mapping as well as simple and robust control. It is suitable for material-handling, reconfigurable-fixturing, and mobile-manipulation tasks in a flexible-manufacturing environment. Using its three leg, and matching pin-socket couplings with the base surface, each agent either stands fixed or strides along via “Swing and Dock” (SaD) locomotion. Each mounting pin can serve both as a connecting-locking device and as a pivot of a planar rotation. Previous work offered planning solutions only for the agents’ positions. In reality, the orientation in which the agent arrives at the goal is very important because neither robot workspaces nor workcell geometries have axial symmetry. Herein, we provide for the required orientational planning by labelling the agent’s legs to keep track of its rotation. Integer Linear Programming (ILP) is used to model the path planning problem in the so augmented configuration space. The mathematical formulations are implemented and tested using a GUROBI solver. Computational results display the effectiveness of the approach.


2017 ◽  
Vol 14 (1) ◽  
pp. 17-24 ◽  
Author(s):  
James Keller ◽  
Dinesh Thakur ◽  
Maxim Likhachev ◽  
Jean Gallier ◽  
Vijay Kumar

2016 ◽  
Vol 48 ◽  
pp. 182-192 ◽  
Author(s):  
Liwei Huang ◽  
Hong Qu ◽  
Peng Ji ◽  
Xintong Liu ◽  
Zhen Fan

2014 ◽  
Vol 494-495 ◽  
pp. 1003-1007 ◽  
Author(s):  
Li Gong ◽  
Yong Zhang ◽  
Jin Cheng

In this paper, two robots in different positions with two different paths are planned based on RRT algorithm. And two robots search the ball according to the planned paths coordinated with each other under the circumstance of existing static obstacles. Simulation result showed that the correctness of the planned path. RRT algorithm is suitable for path planning of high dimensional robot under complex environment, which avoids complicated modeling of robot and obstacles in C space. And RRT algorithm uses tree structure, which tracks between adjacent node accord with requirements of robots kinematics, dynamics and avoiding collision. Therefore, it is suitable for practical application of robots.


Sign in / Sign up

Export Citation Format

Share Document