Fast Coupled Path Planning: From Pseudo-Polynomial to Polynomial
From MaRDI portal
Publication:3578342
DOI10.1007/978-3-642-14031-0_45zbMath1286.92031OpenAlexW1507141293MaRDI QIDQ3578342
Publication date: 20 July 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-14031-0_45
Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59) Medical applications (general) (92C50)
This page was built for publication: Fast Coupled Path Planning: From Pseudo-Polynomial to Polynomial