BN.com Gift Guide

Algorithmic Foundations of Robotics VI / Edition 1

Hardcover (Print)
Buy New
Buy New from BN.com
$176.58
Used and New from Other Sellers
Used and New from Other Sellers
from $62.70
Usually ships in 1-2 business days
(Save 75%)
Other sellers (Hardcover)
  • All (9) from $62.70   
  • New (6) from $142.25   
  • Used (3) from $62.70   

Overview

Robot algorithms are abstractions of computational processes that control or reason about motion and perception in the physical world. Because actions in the physical world are subject to physical laws and geometric constraints, the design and analysis of robot algorithms raise a unique combination of questions in control theory, computational and differential geometry, and computer science. Algorithms serve as a unifying theme in the multi-disciplinary field of robotics.

This volume consists of selected contributions to the sixth Workshop on the Algorithmic Foundations of Robotics. This is a highly competitive meeting of experts in the field of algorithmic issues related to robotics and automation.

Read More Show Less

Product Details

  • ISBN-13: 9783540257288
  • Publisher: Springer Berlin Heidelberg
  • Publication date: 8/11/2005
  • Series: Springer Tracts in Advanced Robotics Series , #17
  • Edition description: 2005
  • Edition number: 1
  • Pages: 456
  • Product dimensions: 1.00 (w) x 6.14 (h) x 9.21 (d)

Table of Contents

Algorithmic challenges in structural molecular biology and proteomics 1
Networked robots : ten years of experiments 11
Algorithmic foundation of the Clockwork Orange robot soccer team 17
Uniform coverage of simple surfaces embedded in R[superscript 3] for auto-body painting 27
Stealth tracking of an unpredictable target among obstacles 43
Multi-step motion planning for free-climbing robots 59
Sampling-based motion planning under kinematic loop-closure constraints 75
Composing navigation functions on Cartesian products of manifolds with boundary 91
Adaptive RRTs for validating hybrid robotic control systems 107
Collision free motion planning on graphs 123
Online searching with an autonomous robot 139
Competitive complexity of mobile robot on line motion planing problems 155
Pareto optimal coordination on roadmaps 171
Automatic generation of camera motion to track a moving guide 187
Computing deform closure grasps 203
Coordinating multiple droplets in planar array digital microfluidics systems 219
Topological mapping with sensing-limited robots 235
Locating and capturing an evader in a polygonal environment 251
Semi-differential invariants for recognition of algebraic curves 267
Modeling macromolecular machines using rigid-cluster networks 283
Fast tree-based exploration of state space for robots with dynamics 297
Incremental grid sampling strategies in robotics 313
Toward complete path planning for planar 3R-manipulators among point obstacles 329
Computing protein structures from electron density maps : the missing fragment problem 345
A machine learning approach for feature-sensitive motion planning 361
Probik : protein backbone motion by inverse kinematics 377
Randomized algorithms for minimum distance localization 393
Multi-point contact models for dynamic self-righting of a hexapod 409
Gap navigation trees : a minimal representation for visibility-based tasks 425
A simple algorithm for complete motion planning of translating polyhedral robots 441
Read More Show Less

Customer Reviews

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

5 Star

(0)

4 Star

(0)

3 Star

(0)

2 Star

(0)

1 Star

(0)

Your Rating:

Your Name: Create a Pen Name or

Barnes & Noble.com 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 & Noble.com 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 & Noble.com 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 BN.com 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

Reminder:

  • - By submitting a review, you grant to Barnes & Noble.com and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Noble.com Terms of Use.
  • - Barnes & Noble.com reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & Noble.com 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 BN.com. 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)