Incremental sampling-based algorithms for a class of pursuit-evasion games

DOI10.1007/978-3-642-17452-0_5MaRDI QIDQ3020398zbMATH OpenOpenAlexFDO

Authors Sertaç 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

Mathematics Subject Classification ID

Positional games (pursuit and evasion, etc.) (91A24)

Recommendations

• scientific article; zbMATH DE number 1507318
• A point-based approximate algorithm for one-sided partially observable pursuit-evasion games
• On closed-loop controls in pursuit-evasion
• A framework for pursuit evasion games in
• An efficient algorithm for a visibility-based surveillance-evasion game

Cited in

(25)

• Efficient path planning algorithms in reach-avoid problems
• The planning of optimal motions of non-holonomic systems
• A new class of pursuer strategies for the discrete-time lion and man problem
• Iterative methods for efficient sampling-based optimal motion planning of nonlinear systems
• Collective motion planning for a group of robots using intermittent diffusion
• On the equivalence of pursuer strategies and the lack of Nash equilibrium in a visibility pursuit-evasion game
• Simultaneous orthogonal collocation decomposition method for extended \textit{Lion and Man} problems
• Learning excursion sets of vector-valued Gaussian random fields for autonomous ocean sampling
• Multiquery motion planning in uncertain spaces: incremental adaptive randomized roadmaps
• Unconstrained and curvature-constrained shortest-path distances and their approximation
• Adaptive operator quantum-behaved pigeon-inspired optimization algorithm with application to UAV path planning
• A point-based approximate algorithm for one-sided partially observable pursuit-evasion games
• Sampling-based motion planning for uncertain high-dimensional systems via adaptive control
• Synchronized multi-arm rearrangement guided by mode graphs with capacity constraints
• Pushing the boundaries of asymptotic optimality in integrated task and motion planning
• Path planning followed by kinodynamic smoothing for multirotor aerial vehicles (MAVs)
• scientific article; zbMATH DE number 1908214 (Why is no real title available?)
• Smarter Lions: efficient cooperative pursuit in general bounded arenas
• Human robot collaborative assembly planning: an answer set programming approach
• Problem of controlling a group of quadrocopters when moving along a given curve
• Rotorcraft low-noise trajectories design: black-box optimization using surrogates
• Kinodynamic Control Systems and Discontinuities in Clearance
• Schwarzschild Harmonic Path Planning and Tetrahedral Mesh Smoothing
• Formal methods for robot motion planning with time and space constraints (extended abstract)
• Pursuit-evasion games in the presence of obstacles

This page was built for publication: Incremental sampling-based algorithms for a class of pursuit-evasion games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3020398)