Search for randomly moving targets II: Search path planning

1987 ◽  
Author(s):  
I. Yan ◽  
G. Blankenship
2021 ◽  
pp. 103985
Author(s):  
Yizhi Wu ◽  
Fei Xie ◽  
Lei Huang ◽  
Rui Sun ◽  
Jiquan Yang ◽  
...  

Author(s):  
Jung-Hong Cho ◽  
Jea-Soo Kim ◽  
Jun-Seok Lim ◽  
Seongil Kim ◽  
Young-Sun Kim

2007 ◽  
Vol 61 (1) ◽  
pp. 31-43 ◽  
Author(s):  
Ki Yin Chang ◽  
Gene Eu Jan ◽  
Chien-Min Su ◽  
Ian Parberry

This article presents efficient and practical methods for path planning of optimal interceptions on two-dimensional grids with obstacles, such as raster charts or non-distorted digital maps. The proposed methods search for optimal paths from sources to multiple moving-targets by a novel higher geometry wave propagation scheme in the grids, instead of the traditional vector scheme in the graphs. By introducing a time-matching scheme, the optimal interception paths from sources to all the moving-targets are obtained among the combinations with linear time and space complexities. Two optimal path planning methods for multiple one-to-one interceptions, the MIN-MAX and MIN-AVG, are applied to emulate the real routing.


Author(s):  
Jeffrey Xu ◽  
Thomas Le Pichon ◽  
Isaac Spiegel ◽  
Dustin Hauptman ◽  
Shawn Keshmiri

Sign in / Sign up

Export Citation Format

Share Document