Articoli correlati a Unobstructed Shortest Paths in Polyhedral Environments:...

Unobstructed Shortest Paths in Polyhedral Environments: 251 - Brossura

Akman, Varol

 
9783540176299: Unobstructed Shortest Paths in Polyhedral Environments: 251

Sinossi

Presents algebraic and geometric algorithms to deal with a specific problem, which frequently occurs in model-based robotics systems and is of utmost importance in calibrating the complexity of robotics tasks in general. The algorithms are based on several ideas from areas such as elimination theory, optimization, polyhedral theory and Voronoi diagrams. The algorithms were also implemented in a Lisp in a workbench to allow experimentation with shortest path problems.

Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.

Contenuti

Solution of the general instance of FINDPATH.- Solutions of two specific instances of FINDPATH.- Two Voronoi-based techniques for FINDPATH.- Desirable functionalities of a geometer's workbench.- Conclusion and future work.

Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.