Recursive Path Planning Using Reduced States for Car-Like Vehicles on Grid Maps

Cited 17 time in webofscience Cited 0 time in scopus
  • Hit : 625
  • Download : 0
We present a recursive path-planning method that efficiently generates a path by using reduced states of the search space and taking into account the kinematics, shape, and turning space of a car-like vehicle. Our method is based on a kinematics-aware node expansion method that checks for collisions based on the shape and turning space of a vehicle. We present two heuristics that simultaneously consider the kinematics of a vehicle with and without obstacles. In particular, for challenging environments containing complex obstacles and even narrow passages, we recursively identify intermediate goals and nodes that allow the vehicle to compute a path to its destination. We show the benefits of our method through simulations and experimental results by using an autonomous ground vehicle. Furthermore, we show that our method can efficiently generate a collision-free path for vehicles in complex environments with passageways.
Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
Issue Date
2015-10
Language
English
Article Type
Article
Keywords

AUTONOMOUS VEHICLES; PROBABILISTIC ROADMAPS; ENVIRONMENTS; TRACKING; ASTERISK; INTERPOLATION; NAVIGATION; SEARCH; ROBOTS

Citation

IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS, v.16, no.5, pp.2797 - 2813

ISSN
1524-9050
DOI
10.1109/TITS.2015.2422991
URI
http://hdl.handle.net/10203/205311
Appears in Collection
CS-Journal Papers(저널논문)EE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 17 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0