Name
Abstract | ||
|---|---|---|
We propose a computational strategy to find the optimal path for a mobile sensor with limited coverage to traverse a cluttered region. The goal is to find one of the shortest feasible paths to achieve the complete scan of the environment. We pose the problem in the level set framework, and first consider a related question of placing multiple stationary sensors to obtain the full surveillance of the environment. By connecting the stationary locations using the nearest neighbor strategy, we form the initial guess for the path planning problem of the mobile sensor. Then the path is optimized by reducing its length, via solving a system of ordinary differential equations (ODEs), while maintaining the complete scan of the environment. Furthermore, we use intermittent diffusion, which converts the ODEs into stochastic differential equations (SDEs), to find an optimal path whose length is globally minimal. To improve the computation efficiency, we introduce two techniques, one to remove redundant connecting points to reduce the dimension of the system, and the other to deal with the entangled path so the solution can escape the local traps. Numerical examples are shown to illustrate the effectiveness of the proposed method. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1016/j.jcp.2015.07.037 | Journal of Computational Physics |
Keywords | Field | DocType |
Path planning,Limited coverage,Complete scan | Motion planning,Mathematical optimization,Ordinary differential equation,Shortest path problem,Level set,Stochastic differential equation,Longest path problem,Fast path,Mathematics,Traverse | Journal |
Volume | Issue | ISSN |
299 | C | 0021-9991 |
Citations | PageRank | References |
0 | 0.34 | 20 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sung Ha Kang | 1 | 430 | 29.39 |
| Seong Jun Kim | 2 | 7 | 2.10 |
| Hao-Min Zhou | 3 | 174 | 17.98 |