Timeconstrained graph searches with provable bounds on suboptimality

1
Graph Search-based Planning in Robotics (M.
Likhachev)

• Time-constrained graph searches with provable
  bounds on suboptimality
• anytime graph searches for planning under time
  constraints (ARA)
• incremental graph searches for planning in
  unknown environments (D Lite, Anytime D,)
• randomized graph searches for planning in
  high-dim. spaces with probabilistic bounds on
  suboptimality (R)

Motion planning for articulated robots

• Decentralized graph searches for the multi-agent
  coordination
• Large-scale decision-theoretic planning under
  uncertainty with graph searches

Motion planning for household robots (with Willow
Garage)
Motion planning for unmanned helicopters (with
DPI)
Planning among dynamic obstacles with
time-bounded graphs
control of teams of robots
Autonomous landing (with DPI)
large-scale path clearance