Varol Akman
Unobstructed Shortest Paths in Polyhedral Environments
Paperback Engels 1987 1987e druk 9783540176299
Verwachte levertijd ongeveer 9 werkdagen
Samenvatting
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.
Specificaties
ISBN13:9783540176299
Taal:Engels
Bindwijze:paperback
Aantal pagina's:106
Uitgever:Springer Berlin Heidelberg
Druk:1987
Hoofdrubriek:Programmeren, Computer en informatica
Lezersrecensies
Wees de eerste die een lezersrecensie schrijft!
Inhoudsopgave
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.
Rubrieken
- advisering
- algemeen management
- coaching en trainen
- communicatie en media
- economie
- financieel management
- inkoop en logistiek
- internet en social media
- it-management / ict
- juridisch
- leiderschap
- marketing
- mens en maatschappij
- non-profit
- ondernemen
- organisatiekunde
- personal finance
- personeelsmanagement
- persoonlijke effectiviteit
- projectmanagement
- psychologie
- reclame en verkoop
- strategisch management
- verandermanagement
- werk en loopbaan