| Record ID | marc_columbia/Columbia-extract-20221130-004.mrc:102999534:3665 |
| Source | marc_columbia |
| Download Link | /show-records/marc_columbia/Columbia-extract-20221130-004.mrc:102999534:3665?format=raw |
LEADER: 03665mam a2200421 a 4500
001 1576461
005 20220608192437.0
008 940215t19941994nyua b 001 0 eng
010 $a 94008291
020 $a0471019038 (acid-free paper)
035 $a(OCoLC)29911528
035 $a(OCoLC)ocm29911528
035 $9AKG7193CU
035 $a(NNC)1576461
035 $a1576461
040 $aDLC$cDLC$dDLC$dNNC$dOrLoB$dOrLoB
050 00 $aTJ211.4$b.A47 1994
082 00 $a629.8/92$220
100 1 $aAhrikencheikh, Cherif,$d1959-$0http://id.loc.gov/authorities/names/n94015291
245 10 $aOptimized-motion planning :$btheory and implementation /$cCherif Ahrikencheikh, Ali Seireg.
260 $aNew York :$bJ. Wiley,$c[1994], ©1994.
300 $axv, 366 pages :$billustrations ;$c25 cm +$e1 computer disc (3 1/2 in).
336 $atext$btxt$2rdacontent
337 $aunmediated$bn$2rdamedia
490 1 $aWiley series in design engineering
500 $a"A Wiley-Interscience publication."
500 $aSystem requirements for the computer disk: IBM-compatible PC; DOS;640K minimum. Cf. t.p. verso.
504 $aIncludes bibliographical references (p. 354-360) and index.
505 0 $aPt. 1. Introduction. 1. Problem Description and Literature Review -- Pt. 2. Optimum Motion of a Point between Stationary Polygons. 2. Data Organization and Storage. 3. Passage-Network Construction. 4. Feasibility Chart and Path Optimization -- Pt. 3. Motion Planning in Situations with More Than Two Degrees of Freedom. 5. Optimized Path of a Point Between Stationary Polyhedra. 6. Optimized Motion of a Point Between Stationary Polyhedra. 7. Optimized Body Motion Between Stationary or Moving Obstacles. 8. Optimized-Motion Planning for Robot Manipulators.
520 $aThe first handbook to the practical specifics of motion planning, Optimized-Motion Planning offers design engineers methods and insights for solving real motion planning problems in a 3-dimensional space. Complete with a disk of software programs, this unique guide allows users to design, test, and implement possible solutions, useful in a host of contexts, especially tool path planning.
520 8 $aBeginning with a brief overview of the general class of problems examined within the book as well as available solution techniques, Part 1 familiarizes the reader with the conceptual threads that underlie each approach. This early discussion also considers the specific applications of each technique as well as its computational efficiency.
520 8 $aPart 2 illustrates basic problem-solving methodology by considering the case of a point moving between stationary polygons in a plane. This section features algorithms for data organization and storage, the concepts of passage networks and feasibility charts, as well as the path optimization algorithm.
520 8 $aElaborating on the problematic model described in Part 2, Part 3 develops an algorithm for optimizing the motion of a point between stationary polyhedra in a 3-dimensional space. This algorithm is first applied to the case of nonpoint objects moving between obstacles that can be stationary or moving with known patterns. It's then used in connection with the extensively investigated problem of motion planning for multilink manipulators.
650 0 $aRobots$xMotion.$0http://id.loc.gov/authorities/subjects/sh86005656
650 0 $aMotion.$0http://id.loc.gov/authorities/subjects/sh85087557
700 1 $aSeireg, Ali.$0http://id.loc.gov/authorities/names/n80124917
830 0 $aWiley series in design engineering.$0http://id.loc.gov/authorities/names/n92074147
852 00 $boff,eng$hTJ211.4$i.A47 1994