Robust Lattice-based Motion Planning
This paper proposes a robust lattice-based motion-planning algorithm for nonlinear systems affected by a bounded disturbance. The proposed motion planner utilizes the nominal disturbance-free system model to generate motion primitives, which are associated with fixed-size tubes. These tubes are characterized through designing a feedback controller, that guarantees boundedness of the errors occurring due to mismatch between the disturbed nonlinear system and the nominal system. The motion planner then sequentially implements the tube-based motion primitives while solving an online graph-search problem. The objective of the graph-search problem is to connect the initial state to the final state, through sampled states in a suitably discretized state space, such that the tubes do not pass through any unsafe states (representing obstacles) appearing during runtime. The proposed strategy is implemented on an Euler-Lagrange based ship model which is affected by significant wind disturbance. It is shown that the uncertain system trajectories always stay within a suitably constructed tube around the nominal trajectory and terminate within a region around the final state, whose size is dictated by the size of the tube.
Code (0)
등록된 구현이 없습니다.
Tasks
Motion PlanningSimilar Papers 제목 키워드 기반
Graduated Fidelity Lattices for Motion Planning under Uncertainty
We present a novel approach for motion planning in mobile robotics under sensing and motion uncertainty based on state lattices with graduated fidelity. The probability of collision is reliably estimated considering the …
Motion PlanningOn-line and on-board planning and perception for quadrupedal locomotion
We present a legged motion planning approach for quadrupedal locomotion over challenging terrain. We decompose the problem into body action planning and footstep planning. We use a lattice representation together with a …
Motion PlanningMeshA*: Efficient Path Planing With Motion Primitives
We study a path planning problem where the possible move actions are represented as a finite set of motion primitives aligned with the grid representation of the environment. That is, each primitive corresponds to a shor…
Heuristic SearchAdaptive Lattice-based Motion Planning
This paper proposes an adaptive lattice-based motion planning solution to address the problem of generating feasible trajectories for systems, represented by a linearly parameterizable non-linear model operating within a…
Motion PlanningCombinatorics of a Discrete Trajectory Space for Robot Motion Planning
Motion planning is a difficult problem in robot control. The complexity of the problem is directly related to the dimension of the robot's configuration space. While in many theoretical calculations and practical applica…
Motion Planning