Reproduce “Goal-Reaching Trajectory Design Near Danger with Piecewise Affine Reach-avoid Computation” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Long Kiu Chung, Wonsuhk Jung, Chuizheng Kong, Shreyas Kousik
Researchers at the Georgia Institute of Technology developed Piecewise Affine Reach-avoid Computation (PARC), a method for provably safe robot trajectory design in narrow gaps and near obstacles. It achieves less conservative reach-avoid guarantees by leveraging piecewise affine system modeling and H-polytope set computations, outperforming existing state-of-the-art techniques.
Key insights
- Cooperative planner-tracker interaction allows for smaller, time-varying tracking error bounds, enhancing liveness without sacrificing safety in confined spaces.
- Representing robot dynamics as PWA systems and using H-polytopes for set computations provides a tighter approximation of reachable sets, minimizing numerical conservativeness.
- Focusing reachability analysis on a specific mode sequence derived from an "expert plan" for the PWA system dramatically speeds up the computation of Backward Reach-Avoid Sets.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.