Using interval arithmetic to prove that a set is path-connected

DOI10.1016/J.TCS.2005.09.055zbMATH Open1087.68068OpenAlexW2141959453MaRDI QIDQ817868FDOQ817868

Authors: Nicolas Delanoue, Bertrand Cottenceau, L. Jaulin 

Publication date: 20 March 2006

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2005.09.055

Recommendations

• Path planning using intervals and graphs
• Computing Roadmaps of General Semi-Algebraic Sets
• scientific article; zbMATH DE number 589123
• Publication:4892225
• scientific article; zbMATH DE number 3854311

zbMATH Keywords

topologygraph theoryinterval arithmeticautomatic proofconnected setset computation

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) General methods in interval analysis (65G40)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Morse Theory. (AM-51)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Identification of parametric models from experimental data. Transl. from an upd. French version by the authors, with the help of John Norton
• Spatial Planning: A Configuration Space Approach
• Title not available (Why is that?)

Cited In (5)

• Solving set-valued constraint satisfaction problems
• Guaranteeing the homotopy type of a set defined by non-linear inequalities
• Bracketing backward reach sets of a dynamical system
• Robust set-membership state estimation; application to underwater robotics
• Solving non-linear constraint satisfaction problems involving time-dependent functions

This page was built for publication: Using interval arithmetic to prove that a set is path-connected

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