Interval computing of the viability kernel with application to robotic collision avoidance

DOI10.1007/978-3-319-70619-1_13MaRDI QIDQ1622606zbMATH OpenOpenAlexFDO

Authors Stéphane Le Ménec

Publication date 19 November 2018

Full work available at URL https://doi.org/10.1007/978-3-319-70619-1_13

zbMATH Keywords

collision avoidanceroboticspursuit-evasion gamesviability theoryviability kernelnoncooperative differential gamesinterval computinggame of two identical carsbackward reachable setscapture basincontractor programminglevel sets of the value function

Mathematics Subject Classification ID

2-person games (91A05) Artificial intelligence for robotics (68T40) Attainable sets, reachability (93B03) Automated systems (robots, etc.) in control theory (93C85) Positional games (pursuit and evasion, etc.) (91A24)

Recommendations

• Interval analysis for certified numerical solution of problems in robotics
• Interval methods in robot navigation
• Computation of robust capture zones using interval-based viability techniques in presence of state uncertainties
• Computing the viability kernel using maximal reachable sets
• DETERMINATION OF THE OPTIMAL MAXIMUM ISSUE QUANTITY FOR LUMPY DEMAND ITEMS WHEN CONTROLLED BY AN U,S) POLICY
• Reliably Safe Path Planning Using Interval Analysis
• scientific article; zbMATH DE number 1487508
• Collision avoidance for mobile robots based on an occupancy grid

Cited in

(4)

• Computation of robust capture zones using interval-based viability techniques in presence of state uncertainties
• Approximating Viability Kernels of Non-linear Systems
• Computation of discriminating kernel and robust capture basin with regulation map by interval methods
• A viability approach for fast recursive feasible finite horizon path planning of autonomous RC cars

This page was built for publication: Interval computing of the viability kernel with application to robotic collision avoidance

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