Intelligent Robotic Planning SystemsWorld Scientific, 1993 - 265 lappuses This volume focusses on the problem of planning in the context of robotics. Unlike most books on robotics planning which are either too abstract or too specific, this one extends the techniques developed for generic planning problems with robotics-specific considerations so that the task of planning can be discussed in a more uniform way. It also includes the latest results in reconfigurable (mobile) robot planning, multiple robot planning, plan recovery, and planning in uncertain environments. This volume is probably the very first book in the market that provides a theoretical foundation for planning techniques and their applications. It also bridges the gap that has been existing for a long time between computer scientists and application engineers. It will be of interest to senior and graduate students in engineering and computer science, AI researchers and professionals. |
No grāmatas satura
1.–5. rezultāts no 46.
5. lappuse
Atvainojiet, šīs lappuses saturs ir ierobežots..
Atvainojiet, šīs lappuses saturs ir ierobežots..
32. lappuse
Atvainojiet, šīs lappuses saturs ir ierobežots..
Atvainojiet, šīs lappuses saturs ir ierobežots..
45. lappuse
Atvainojiet, šīs lappuses saturs ir ierobežots..
Atvainojiet, šīs lappuses saturs ir ierobežots..
50. lappuse
Atvainojiet, šīs lappuses saturs ir ierobežots..
Atvainojiet, šīs lappuses saturs ir ierobežots..
51. lappuse
Atvainojiet, šīs lappuses saturs ir ierobežots..
Atvainojiet, šīs lappuses saturs ir ierobežots..
Saturs
PREFACE | 1 |
Robot | 15 |
AN OBJECTORIENTED ROBOT PROGRAMMING | 25 |
CLASSICAL ROBOTIC TASK PLANNING SYSTEMS | 47 |
CONSTRUCTIVE ROBOT TASK PLANNING | 75 |
ROBOT PATH PLANNING | 109 |
TASK PLANNING FOR COORDINATED MULTIPLE | 155 |
MOTION PLANNING FOR COORDINATED | 170 |
ROBOT PATH PLANNING IN UNKNOWN | 205 |
CONCLUSIONS | 250 |
262 | |
Citi izdevumi - Skatīt visu
Bieži izmantoti vārdi un frāzes
5-link closed 6-link closed chain algorithm approach assumed blocks world problem boundary boundary representation C-space obstacles C-subspace carried object CFFR channel elements clear(C collision avoidance collision-free feasible configuration collision-free path computed configuration space connection graph consumer-producer convex convex hull convex polygons coordinate corresponding cuboid defined end-effector Example free region free space geometric go to step goal configuration Graham Scan handempty initial configuration intersection joint space line segment M-line method mobile automaton mobile robots motion multiple robots nodes octree ontable(A operations ordering problem partial ordering path planning path planning algorithm permission of IEEE pickup(A planner polygon potential field procedure programming languages protector quadtree representation represented Reprinted robot arm robot manipulator rotational sequence shown in Figure slice projection solid object solved stack(A,C stack(C,B subgoals task planning TC-curve terrain top stack unknown environment unstack(C,A variables velocity vertex vertices visibility graph workspace
Atsauces uz šo grāmatu
Mechatronic Systems Techniques and Applications, 2. sējums Cornelius T. Leondes Ierobežota priekšskatīšana - 2000 |