Incremental Sampling-Based Algorithms for a Class of Pursuit-Evasion Games

From MaRDI portal
Publication:3020398

DOI10.1007/978-3-642-17452-0_5zbMath1220.91006OpenAlexW1524674316MaRDI QIDQ3020398

Sertac Karaman, Emilio Frazzoli

Publication date: 4 August 2011

Published in: Springer Tracts in Advanced Robotics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-17452-0_5




Related Items (23)

Formal methods for robot motion planning with time and space constraints (extended abstract)Adaptive operator quantum-behaved pigeon-inspired optimization algorithm with application to UAV path planningEfficient path planning algorithms in reach-avoid problemsProblem of controlling a group of quadrocopters when moving along a given curveUnconstrained and curvature-constrained shortest-path distances and their approximationRotorcraft low-noise trajectories design: black-box optimization using surrogatesKinodynamic Control Systems and Discontinuities in ClearanceSmarter Lions: Efficient Cooperative Pursuit in General Bounded ArenasThe planning of optimal motions of non-holonomic systemsSchwarzschild Harmonic Path Planning and Tetrahedral Mesh SmoothingPursuit-evasion games in the presence of obstaclesSimultaneous orthogonal collocation decomposition method for extended \textit{Lion and Man} problemsHuman Robot Collaborative Assembly Planning: An Answer Set Programming ApproachA new class of pursuer strategies for the discrete-time lion and man problemLearning excursion sets of vector-valued Gaussian random fields for autonomous ocean samplingIterative methods for efficient sampling-based optimal motion planning of nonlinear systemsMultiquery motion planning in uncertain spaces: incremental adaptive randomized roadmapsSampling-Based Motion Planning for Uncertain High-Dimensional Systems via Adaptive ControlSynchronized Multi-arm Rearrangement Guided by Mode Graphs with Capacity ConstraintsPushing the Boundaries of Asymptotic Optimality in Integrated Task and Motion PlanningCollective motion planning for a group of robots using intermittent diffusionPath Planning Followed by Kinodynamic Smoothing for Multirotor Aerial Vehicles (MAVs)On the equivalence of pursuer strategies and the lack of Nash equilibrium in a visibility pursuit-evasion game




This page was built for publication: Incremental Sampling-Based Algorithms for a Class of Pursuit-Evasion Games