A Loop-Free Path-Finding Algorithm: Specification, Verification and Complexity

1995 ◽  
Author(s):  
J. J. Garcia-Luna-Aceves ◽  
Shree Murthy
Keyword(s):  
Free Path ◽  
Path Finding

PATH PLANNING FOR TWO COOPERATING ROBOTS

1990 ◽  
Vol 04 (02) ◽  
pp. 269-301 ◽  
Author(s):  
QING XUE ◽  
PHILLIP C.-Y. SHEU
Keyword(s):  
Path Planning ◽  
Free Path ◽  
Initial Position ◽  
Planning Problem ◽  
Path Finding ◽  
Closed Chain ◽  
Discrete Interval ◽  
Cooperating Robots ◽  
Position And Orientation ◽  
Path Planning Problem

We investigate the problem of finding collision-free paths for two planar robots which coordinately carry a rectangular object from an initial position and orientation to a destination position and orientation in a cluttered 2-D environment. The robot arms and the carried object construct a 6-link closed chain. The path planning problem for the 6-link closed chain is solved by using two major algorithms: the collision-free feasible configuration finding algorithm and the collision-free path finding algorithm. The collision-free feasible configuration finding algorithm finds all collision-free feasible configurations (CFFCs) of the 6-link closed chain in each discrete interval of two joint angles. The collision-free path finding algorithm builds a connection graph by CFFCs and the transitions between any two groups of CFFCs at adjacent joint intervals. Then a graph search method is used to find a collision-free path for each joint of the robots.

Inelastic mean free path and phase-shift determinations in NiO, using EXELFS

1993 ◽  
Vol 3 (7) ◽  
pp. 1649-1659
Author(s):  
Mohammad A. Tafreshi ◽  
Stefan Csillag ◽  
Zou Wei Yuan ◽  
Christian Bohm ◽  
Elisabeth Lefèvre ◽  
...  
Keyword(s):  
Phase Shift ◽  
Free Path ◽  
Mean Free Path ◽  
Inelastic Mean Free Path
Sign in / Sign up

Export Citation Format

Share Document