PWTO: A Heuristic Approach for Trajectory Optimization in Complex Terrains
Yilin Cai, Zhongqiang Ren

TL;DR
This paper introduces PWTO, a hybrid heuristic method combining graph search and local optimization to generate low-cost, feasible trajectories for robots navigating complex terrains, outperforming baseline methods.
Contribution
The paper presents PWTO, a novel approach that integrates multi-objective graph search with trajectory optimization to effectively handle complex terrain planning problems.
Findings
PWTO achieves solutions with less than half the cost of baseline methods.
PWTO successfully verified in Gazebo simulations with wheeled and quadruped robots.
The approach is open source for community use and further development.
Abstract
This paper considers a trajectory planning problem for a robot navigating complex terrains, which arises in applications ranging from autonomous mining vehicles to planetary rovers. The problem seeks to find a low-cost dynamically feasible trajectory for the robot. The problem is challenging as it requires solving a non-linear optimization problem that often has many local minima due to the complex terrain. To address the challenge, we propose a method called Pareto-optimal Warm-started Trajectory Optimization (PWTO) that attempts to combine the benefits of graph search and trajectory optimization, two very different approaches to planning. PWTO first creates a state lattice using simplified dynamics of the robot and leverages a multi-objective graph search method to obtain a set of paths. Each of the paths is then used to warm-start a local trajectory optimization process, so that…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsRobotic Path Planning Algorithms
