Algorithmic Foundations of Robotics V / Edition 1

Paperback (Print)
Buy New
Buy New from
Used and New from Other Sellers
Used and New from Other Sellers
from $205.37
Usually ships in 1-2 business days
(Save 26%)
Other sellers (Paperback)
  • All (5) from $205.37   
  • New (4) from $205.37   
  • Used (1) from $344.40   


Selected contributions to the Workshop WAFR 2002, held December 15-17, 2002, Nice, France.

This fifth biannual Workshop on Algorithmic Foundations of Robotics focuses on algorithmic issues related to robotics and automation. The design and analysis of robot algorithms raises fundamental questions in computer science, computational geometry, mechanical modeling, operations research, control theory, and associated fields. The highly selective program highlights significant new results such as algorithmic models and complexity bounds. The validation of algorithms, design concepts, or techniques is the common thread running through this focused collection.

Read More Show Less

Product Details

  • ISBN-13: 9783642073410
  • Publisher: Springer Berlin Heidelberg
  • Publication date: 12/6/2010
  • Series: Springer Tracts in Advanced Robotics Series, #7
  • Edition description: Softcover reprint of hardcover 1st ed. 2004
  • Edition number: 1
  • Pages: 578
  • Product dimensions: 1.20 (w) x 9.21 (h) x 6.14 (d)

Table of Contents

Algorithms for Motion and Navigation in Virtual Environments and Games.- Motion Planning for Knot Untangling.- Exact Collision Checking of Robot Paths.- A Comparative Study of Probabilistic Roadmap Planners.- On the Relationship between Classical Grid Search and Probabilistic Roadmaps.- Algorithms for Rapidly Dispersing Robot Swarms in Unknown Environments.- Better Group Behaviors Using Rule-Based Roadmaps.- A Delaunay Approach to Interactive Cutting in Triangulated Surfaces.- Shastic Conformational Roadmaps for Computing Ensemble Properties of Molecular Motion.- View Planning via Maximal C-space Entropy Reduction.- Exact and Distributed Algorithms for Collaborative Camera Control.- Shape Complexes for Metamorhpic Robots.- Flexonics.- Coordinating Multiple Robots with Kinodynamic Constraints along Specified Paths.- Hybrid Motion Planning: Coordinating Two Discs Moving among Polygonal Obstacles in the Plane.- Decentralized Algorithms for Multirobot Manipulation via Caging.- Communication Complexity of Multi-robot Systems.- Reconstructing the Shape and Motion of Unknown Objects with Active Tactile Sensors.- A General Manipulation Task Planner.- Computation on Parametric Curves with Applications in Localization and Grasping.- A Near-Quadratic Algorithm for Fence Design.- Simultaneous Mapping and Localization with Sparse Extended Information Filters: Theory and Initial Results.- Expected Shortest Paths for Landmark-Based Robot Navigation.- Sensor-Based Coverage: Incremental Construction of Cellular Decompositions.- Online Scan Coverage of Grid Environments by a Mobile Robot.- Distributed Motion Planning for 3D Modular Robots with Unit-Compressible Modules.- Distributed Manipulation with Rolling Contact.- Computing Equilibria on Superpositions of Logarithmic-Radial Potential Fields.- Feedback Control for Distributed Manipulation.- Fast Penetration Depth Estimation Using Rasterization Hardware and Hierarchical Refinement.- Generalizing Demonstrated Manipulation Tasks.- Constraint-Based Motion Planning Using Voronoi Diagrams.- Trajectory Planning for Kinematically Controllable Underactuated Mechanical Systems.

Read More Show Less

Customer Reviews

Be the first to write a review
( 0 )
Rating Distribution

5 Star


4 Star


3 Star


2 Star


1 Star


Your Rating:

Your Name: Create a Pen Name or

Barnes & Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at or to post customer reviews. Please see our Terms of Use for more details.

What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

Reviews should not contain any of the following:

  • - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
  • - Time-sensitive information such as tour dates, signings, lectures, etc.
  • - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
  • - Comments focusing on the author or that may ruin the ending for others
  • - Phone numbers, addresses, URLs
  • - Pricing and availability information or alternative ordering information
  • - Advertisements or commercial solicitation


  • - By submitting a review, you grant to Barnes & and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Terms of Use.
  • - Barnes & reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & also reserves the right to remove any review at any time without notice.
  • - See Terms of Use for other conditions and disclaimers.
Search for Products You'd Like to Recommend

Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously

    If you find inappropriate content, please report it to Barnes & Noble
    Why is this product inappropriate?
    Comments (optional)