Muutke küpsiste eelistusi

Algorithmic and Geometric Aspects of Robotics (Routledge Revivals) [Pehme köide]

Edited by , Edited by
  • Formaat: Paperback / softback, 322 pages, kõrgus x laius: 234x156 mm, kaal: 539 g
  • Ilmumisaeg: 31-Mar-2021
  • Kirjastus: Routledge
  • ISBN-10: 1138203505
  • ISBN-13: 9781138203501
  • Formaat: Paperback / softback, 322 pages, kõrgus x laius: 234x156 mm, kaal: 539 g
  • Ilmumisaeg: 31-Mar-2021
  • Kirjastus: Routledge
  • ISBN-10: 1138203505
  • ISBN-13: 9781138203501

First published in 1987, the seven chapters that comprise this book review contemporary work on the geometric side of robotics. The first chapter defines the fundamental goal of robotics in very broad terms and outlines a research agenda each of whose items constitutes a substantial area for further research. The second chapter presents recently developed techniques that have begun to address the geometric side of this research agenda and the third reviews several applied geometric ideas central to contemporary work on the problem of motion planning. The use of Voronoi diagrams, a theme opened in these chapters, is explored further later in the book. The fourth chapter develops a theme in computational geometry having obvious significance for the simplification of practical robotics problems — the approximation or decomposition of complex geometric objects into simple ones. The final chapters treat two examples of a class of geometric ‘reconstruction’ problem that have immediate application to computer-aided geometric design systems.

Preface ix
Introduction 1(6)
Chee-Keng Yap
1 Why Robotics?
1(2)
2 An Overview of the Contents of the Volume
3(1)
3 Brief Review of Standard Terminology
4(3)
1 The Challenge of Robotics for Computer Science
7(36)
John E. Hopcroft
Dean B. Krafft
1 What is Robotics?
7(2)
2 A New Science
9(1)
3 Representations for Physical Objects and Processes
10(12)
4 Manipulating Object Representations
22(6)
5 Reasoning
28(12)
6 Conclusions
40(3)
References
40(3)
2 Computational Geometry--A User's Guide
43(52)
David P. Dobkin
Diane L. Souvaine
1 Introduction
43(1)
2 Hierarchical Search
44(22)
3 Hierarchical Computation
66(11)
4 Geometric Transformations
77(13)
5 Conclusion
90(5)
References
91(4)
3 Algorithmic Motion Planning
95(50)
Chee-Keng Yap
1 History
97(2)
2 Basic Concepts
99(604)
3 A Taxonomy of Motion Planning Problems
703
4 Issues Related to Algorithmic Motion Planning
106(2)
5 Moving a Disc
108(4)
6 Moving a Ladder
112(7)
7 Two Approaches to Motion Planning
119(4)
8 Solution to the General Motion Planning Problem
123(6)
9 Retraction Via Cell Complexes
129(3)
10 Lower Bounds
132(5)
11 Summary: New Directions and Open Problems
137(3)
12 Conclusion
140(5)
References
141(4)
4 Approximation and Decomposition of Shapes
145(42)
Bernard Chazelle
1 Introduction
745(1)
2 Approximation of Shapes
746(19)
3 Decomposition of Shapes
765(15)
4 Epilogue
780
References
787
5 Intersection and Proximity Problems and Voronoi Diagrams
187(42)
Daniel Leven
Micha Sharir
1 Introduction
787(3)
2 A Simple Intersection Detection Algorithm in Two-Dimensional Space
790(2)
3 Generalized Planar Voronoi Diagrams
792(5)
4 Applications of Voronoi Diagrams
797
5 Efficient Construction of Voronoi Diagrams
202(74)
6 Dynamic Intersection and Proximity Problems
276(1)
7 The Three-Dimensional Case
276
References
226(3)
6 Fleshing Out Wire Frames: Reconstruction of Objects, Part I
229(30)
George Markowsky
Michael A. Wesley
1 Introduction
229(2)
2 Basic Concepts
231(6)
3 The Wire Frame Algorithm
237(15)
4 Examples
252(7)
Appendix A Topological Concepts
256(2)
References
258(1)
7 Fleshing Out Projections: Reconstruction of Objects, Part II
259(38)
Michael A. Wesley
George Markowsky
1 Introduction
259(2)
2 Basic Concepts and Results
261(8)
3 Fleshing Out Unlabeled Projections
269(11)
4 Additional Information from Drawing Conventions
280(2)
5 Examples
282(10)
6 Summary
292(5)
References
295(2)
Author Index 297(6)
Subject Index 303
Jacob T. Schwartz, Chee-Keng Yap