2018 · 13 citations · 25 references
ComputingMathematicsRobotics EngineeringMotion PlanningOptimizationRoboticsMarkov Chain Monte CarloMonte Carlo MethodsMonte Carlo SimulationRobot Motion PlanningTrajectory GenerationTrajectory OptimizationMarkov Chain Monte Carlo InferenceMulti-objective EvaluationMulti-objective Motion PlanningObjective EvaluationPareto Optimal SetPareto Optimal SolutionSampling-based Motion PlanningSampling-based Trajectory Planning
In this paper, we introduce a Markov chain Monte Carlo (MCMC)method to solve multi-objective motion-planning problems. We formulate the problem of finding Pareto-optimal trajectories as a problem of sampling trajectories from a Pareto-optimal set. We define an implicit uniform distribution over the Pareto-frontier using a dominance function and then sample in the space of trajectories. The nature of MCMC guarantees the convergence to the Pareto-frontier, while the uniform distribution ensures the diversity of the trajectories. We also propose progressive objective evaluation to increase efficiency in problems with expensive-to-evaluate objective functions. This enables determination of dominance relationship between trajectories before they are entirely evaluated. We finally analyze the effectiveness of the framework and its applications in robotics.
25
CHOMP: Gradient optimization techniques for efficient motion planning
Nathan Ratliff, Matt Zucker, J. Andrew Bagnell et al. · 2009 · 986 citations · Full text
STOMP: Stochastic trajectory optimization for motion planning
Mrinal Kalakrishnan, Sachin Chitta, Evangelos A. Theodorou et al. · 2011 · 881 citations