Pith. sign in

REVIEW 1 cited by

Planning, Fast and Slow: A Framework for Adaptive Real-Time Safe Trajectory Planning

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1710.04731 v2 pith:3ZNE6AYE submitted 2017-10-12 cs.SY cs.GTcs.SY

classification cs.SYcs.GT
keywords planningsafetycomputationguaranteeguaranteesmeta-planningmotionobstacles
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Motion planning is an extremely well-studied problem in the robotics community, yet existing work largely falls into one of two categories: computationally efficient but with few if any safety guarantees, or able to give stronger guarantees but at high computational cost. This work builds on a recent development called FaSTrack in which a slow offline computation provides a modular safety guarantee for a faster online planner. We introduce the notion of "meta-planning" in which a refined offline computation enables safe switching between different online planners. This provides autonomous systems with the ability to adapt motion plans to a priori unknown environments in real-time as sensor measurements detect new obstacles, and the flexibility to maneuver differently in the presence of obstacles than they would in free space, all while maintaining a strict safety guarantee. We demonstrate the meta-planning algorithm both in simulation and in hardware using a small Crazyflie 2.0 quadrotor.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Dynamically Feasible Path Planning in Cluttered Environments via Reachable Bezier Polytopes

    cs.RO 2024-11 conditional novelty 5.0 of 10

    Reachable Bezier polytopes enable a real-time, layered path planner that produces dynamically feasible, collision-free paths, demonstrated on a 3D hopping robot.

Pith tools