Abstract
Two problems for path planning of a mobile robot are considered. The first problem is to find a shortest-time, collision-free path for the robot in the presence of stationary obstacles in two dimensions. The second problem is to determine a collision-free path (greedy in time) for a mobile robot in an environment of moving obstacles. The environment is modeled in space-time and the collision-free path is found by a variation of the A algorithm.
Original language | English (US) |
---|---|
Pages (from-to) | 318-322 |
Number of pages | 5 |
Journal | IEEE Transactions on Systems, Man and Cybernetics |
Volume | 22 |
Issue number | 2 |
DOIs | |
State | Published - 1992 |
All Science Journal Classification (ASJC) codes
- General Engineering