Bidding has ended on this item.

Posts to:
United Kingdom
Posts to:
United Kingdom

Details about  Sensing, Intelligence, Motion by Vladimir J. Lumelsky, very rare robotics book.

See original listing
Sensing, Intelligence, Motion by Vladimir J. Lumelsky, very rare robotics book.
Item Ended
Item condition:
Very Good
17 Mar, 2012 16:09:36 GMT
Starting bid:
0 bids ]
May not post to United States - Read item description or contact seller for postage options. | See details
Item location:
London, London, United Kingdom


eBay item number:
Seller assumes all responsibility for this listing.

Item specifics

Condition: Very Good Author: Vladimir Lumelsky
Publication Year: 22/11/2005 Subject: Philosophy & Psychology
Format: Hardback Subject 2: Psychology: Professional & General
Language: English ISBN: 9780471707400

Detailed item information

Describing techniques for handling motion planning tasks in unstructured environments, Sensing, Intelligence Motion fills the need for one comprehensive reference on the subject.

Key Features
Author(s)Vladimir Lumelsky
PublisherJohn Wiley and Sons Ltd
Date of Publication22/11/2005
GenrePsychology: Professional & General

Publication Data
Place of PublicationNew York
Country of PublicationUnited States
ImprintJohn Wiley & Sons Inc
Content NoteIllustrations

Weight717 g
Width161 mm
Height238 mm
Spine25 mm

Table Of ContentsPreface. Acknowledgments. 1 Motion Planning-Introduction. 1.1 Introduction. 1.2 Basic Concepts. 1.2.1 Robot? What Robot? 1.2.2 Space. Objects. 1.2.3 Input Information. Sensing. 1.2.4 Degrees of Freedom. Coordinate Systems. 1.2.5 Motion Control. 1.2.6 Robot Programming. 1.2.7 Motion Planning. 2 A Quick Sketch of Major Issues in Robotics. 2.1 Kinematics. 2.2 Statics. 2.3 Dynamics. 2.4 Feedback Control. 2.5 Compliant Motion. 2.6 Trajectory Modification. 2.7 Collision Avoidance. 2.8 Motion Planning with Complete Information. 2.9 Motion Planning with Incomplete Information. 2.9.1 The Beginnings. 2.9.2 Maze-to-Graph Transition. 2.9.3 Sensor-Based Motion Planning. 2.10 Exercises. 3 Motion Planning for a Mobile Robot. 3.1 The Model. 3.2 Universal Lower Bound for the Path Planning Problem. 3.3 Basic Algorithms. 3.3.1 First Basic Algorithm: Bug1. 3.3.2 Second Basic Algorithm: Bug2. 3.4 Combining Good Features of Basic Algorithms. 3.5 Going After Tighter Bounds. 3.6 Vision and Motion Planning. 3.6.1 The Model. 3.6.2 Algorithm VisBug-21. 3.6.3 Algorithm VisBug-22. 3.7 From a Point Robot to a Physical Robot. 3.8 Other Approaches. 3.9 Which Algorithm to Choose? 3.10 Discussion. 3.11 Exercises. 4 Accounting for Body Dynamics: The Jogger's Problem. 4.1 Problem Statement. 4.2 Maximum Turn Strategy. 4.2.1 The Model. 4.2.2 Sketching the Approach. 4.2.3 Velocity Constraints. Minimum Time Braking. 4.2.4 Optimal Straight-Line Motion. 4.2.5 Dynamics and Collision Avoidance. 4.2.6 The Algorithm. 4.2.7 Examples. 4.3 Minimum Time Strategy. 4.3.1 The Model. 4.3.2 Sketching the Approach. 4.3.3 Dynamics and Collision Avoidance. 4.3.4 Canonical Solution. 4.3.5 Near-Canonical Solution. 4.3.6 The Algorithm. 4.3.7 Convergence. Computational Complexity. 4.3.8 Examples. 5 Motion Planning for Two-Dimensional Arm Manipulators. 5.1 Introduction. 5.1.1 Model and Definitions. 5.2 Planar Revolute-Revolute (RR) Arm. 5.2.1 Analysis. 5.2.2 Algorithm. 5.2.3 Step Planning. 5.2.4 Example. 5.2.5 Motion Planning with Vision and Proximity Sensing. 5.2.6 Concluding Remarks. 5.3 Distinct Kinematic Configurations of RR Arm. 5.4 Prismatic-Prismatic (PP, or Cartesian) Arm. 5.5 Revolute-Prismatic (RP) Arm with Parallel Links. 5.6 Revolute-Prismatic (RP) Arm with Perpendicular Links. 5.7 Prismatic-Revolute (PR) Arm. 5.8 Topology of Arm's Free Configuration Space. 5.8.1 Workspace; Configuration Space. 5.8.2 Interaction Between the Robot and Obstacles. 5.8.3 Uniform Local Connectedness. 5.8.4 The General Case of 2-DOF Arm Manipulators. 5.9 Appendix. 5.10 Exercises. 6 Motion Planning for Three-Dimensional Arm Manipulators. 6.1 Introduction. 6.2 The Case of the PPP (Cartesian) Arm. 6.2.1 Model, Definitions, and Terminology. 6.2.2 The Approach. 6.2.3 Topology of W-Obstacles and C-Obstacles. 6.2.4 Connectivity of C. 6.2.5 Algorithm. 6.2.6 Examples. 6.3 Three-Link XXP Arm Manipulators. 6.3.1 Robot Arm Representation Spaces. 6.3.2 Monotonicity of Joint Space. 6.3.3 Connectivity of Jf. 6.3.4 Retraction of Jf. 6.3.5 Configuration Space and Its Retract. 6.3.6 Connectivity Graph. 6.3.7 Lifting 2D Algorithms into 3D. 6.3.8 Step Planning. 6.3.9 Discussion. 6.4 Other XXX Arms. 7 Human Performance in Motion Planning. 7.1 Introduction. 7.2 Preliminary Observations. 7.2.1 Moving in a Maze. 7.2.2 Moving an Arm Manipulator. 7.2.3 Conclusions and Plan for Experiment Design. 7.3 Experiment Design. 7.3.1 The Setup. 7.3.2 Test Protocol. 7.4 Results-Experiment One. 7.4.1 Principal Components Analysis. 7.4.2 Nonparametric
Author BiographyVLADIMIR J. LUMELSKY, PhD, is Consolidated Papers Professor of Engineering, University of Wisconsin-Madison. Prior to his current appointment, he held positions with Ford Motor Research Laboratories, General Electric Research Center, and Yale University. Dr. Lumelsky is the author or coauthor of more than 200 scholarly publications.

Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Sensing, Intelligence, Motion by Vladimir J. Lumelsky.

An informative look at how humans and robots move in an unstructured world.

Hardback in excellent condition, only read once or twice.

Very rare book, not available to buy for anything less than £80,
grab yourself a bargain!

Thanks for looking.

Questions and answers about this item

No questions or answers have been posted about this item.

Submit bid

Time left:
Current bid:
(Approximately ##1##)
Import charges:
Your maximum bid:
Your maximum bid:
Please read the full listing. By clicking Confirm bid you commit to buy this item from the seller if you are the winning bidder. You will enter a binding contract.
By clicking Confirm bid, you are committing to buy this item from the seller if you are the winning bidder and have read and agree to the Global Shipping Programme terms and conditions - opens in a new window or tab. Import charges previously quoted are subject to change if you increase you maximum bid amount.
Resume bidding, if the page does not update immediately.
Submit bid
Review and confirm your bid
Bid confirmation
Free P&P
See item description
(Approximately ##1##)
(Enter ##1## or more)
(Enter more than ##1##)
Your maximum bid:
Increase maximum bid
Submit bid
Confirm bid
Increase maximum bid
Change bid
, you've been outbid. Don't let it get away - bid again.
, you're the highest bidder on this item. Hope you win it.
, you're the first bidder. Hope you win.
, you're currently the high bidder, but you're close to getting outbid.
, this auction is almost over and you're currently the high bidder.
, you're the high bidder, but the reserve price hasn't been met.
Please enter your bid again.
Please enter a valid number as the bid price.
Enter an amount that is equal or greater than the minimum bid required. This can be found under the bid entry box.
Maximum bids can't be lowered once they're submitted.
This seller requires the buyer to have a PayPal account to purchase this item. Get a PayPal account here .
Your bid is greater than or equal to the Buy it now price. We recommend you purchase this item via Buy it now. If you still wish to bid, you may do so below.
Time left:
Current bid:
(approximately ##1##)
Your maximum bid:
(approximately ##1##)
Increase your maximum bid:
By clicking 1 Click Bid, you are agreeing to buy this item from the seller if you're the winning bidder. Learn moreabout 1-click bid - opens in a new window or tab
(approximately ##1##)
Winning bid:
Starting bid:
Congratulations The auction has ended and you're the winner.
The auction has ended, but the reserve price was not met.
Sorry, the auction has ended and you were outbid.
Good news, you're the highest bidder.
Sorry, you've been outbid.
You're the highest bidder, but the reserve price has not been met.
Please enter a higher amount than the current bid.
Maximum bids cannot be lowered once submitted.
Please enter a valid number.