Robot Path Planning and Cooperation: Foundations, Algorithms and Experimentations: Studies in Computational Intelligence, cartea 772
Autor Anis Koubaa, Hachemi Bennaceur, Imen Chaari, Sahar Trigui, Adel Ammar, Mohamed-Foued Sriti, Maram Alajlan, Omar Cheikhrouhou, Yasir Javeden Limba Engleză Paperback – 5 ian 2019
Toate formatele și edițiile | Preț | Express |
---|---|---|
Paperback (1) | 1018.73 lei 6-8 săpt. | |
Springer International Publishing – 5 ian 2019 | 1018.73 lei 6-8 săpt. | |
Hardback (1) | 1024.85 lei 6-8 săpt. | |
Springer International Publishing – 13 apr 2018 | 1024.85 lei 6-8 săpt. |
Din seria Studies in Computational Intelligence
- 50% Preț: 264.48 lei
- 70% Preț: 235.75 lei
- 20% Preț: 1134.78 lei
- 20% Preț: 966.66 lei
- 20% Preț: 1423.29 lei
- 20% Preț: 168.78 lei
- 18% Preț: 1089.74 lei
- 20% Preț: 565.38 lei
- 20% Preț: 636.14 lei
- 20% Preț: 1026.49 lei
- 20% Preț: 1546.90 lei
- 20% Preț: 630.47 lei
- 20% Preț: 644.20 lei
- 20% Preț: 973.14 lei
- 20% Preț: 970.73 lei
- 20% Preț: 969.90 lei
- 20% Preț: 1142.04 lei
- 20% Preț: 1415.20 lei
- 20% Preț: 1020.82 lei
- 20% Preț: 1026.49 lei
- 20% Preț: 1024.85 lei
- 18% Preț: 2449.69 lei
- 20% Preț: 969.09 lei
- 20% Preț: 1142.04 lei
- 20% Preț: 1140.44 lei
- 20% Preț: 1021.64 lei
- 20% Preț: 1430.55 lei
- 18% Preț: 1375.05 lei
- 18% Preț: 1102.11 lei
- 20% Preț: 1018.40 lei
- 20% Preț: 987.68 lei
- 20% Preț: 1024.07 lei
- 20% Preț: 1249.53 lei
- 20% Preț: 1019.22 lei
- 20% Preț: 968.30 lei
- 20% Preț: 1146.08 lei
- 20% Preț: 1138.80 lei
- 20% Preț: 1037.78 lei
- 20% Preț: 1140.44 lei
- 20% Preț: 1142.87 lei
- 20% Preț: 1429.76 lei
- 18% Preț: 985.35 lei
- 20% Preț: 977.17 lei
- 20% Preț: 1034.54 lei
- 20% Preț: 1258.40 lei
- 20% Preț: 974.89 lei
- 20% Preț: 1027.45 lei
- 20% Preț: 924.65 lei
- 20% Preț: 1149.31 lei
- 20% Preț: 1428.13 lei
Preț: 1018.73 lei
Preț vechi: 1273.41 lei
-20% Nou
Puncte Express: 1528
Preț estimativ în valută:
194.96€ • 202.52$ • 161.95£
194.96€ • 202.52$ • 161.95£
Carte tipărită la comandă
Livrare economică 03-17 februarie 25
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783030083557
ISBN-10: 3030083551
Pagini: 190
Ilustrații: XIX, 190 p. 61 illus., 47 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 0.3 kg
Ediția:Softcover reprint of the original 1st ed. 2018
Editura: Springer International Publishing
Colecția Springer
Seria Studies in Computational Intelligence
Locul publicării:Cham, Switzerland
ISBN-10: 3030083551
Pagini: 190
Ilustrații: XIX, 190 p. 61 illus., 47 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 0.3 kg
Ediția:Softcover reprint of the original 1st ed. 2018
Editura: Springer International Publishing
Colecția Springer
Seria Studies in Computational Intelligence
Locul publicării:Cham, Switzerland
Cuprins
Part I Global Robot Path Planning.- Introduction to Mobile Robot Path Planning.- Background on Artificial Intelligence Algorithms for Global Path Planning .- Design and Evaluation of Intelligent Global Path Planning Algorithms.- Integration of Global Path Planners in ROS.- Robot Path Planning using Cloud Computing for Large Grid Maps.- Part II Multi-Robot Task Allocation.- General Background on Multi-Robot Task Allocation.- Different Approaches to Solve the MRTA Problem.- Performance Analysis of the MRTA Approaches for Autonomous Mobile Robot.
Textul de pe ultima copertă
This book presents extensive research on two main problems in robotics: the path planning problem and the multi-robot task allocation problem. It is the first book to provide a comprehensive solution for using these techniques in large-scale environments containing randomly scattered obstacles. The research conducted resulted in tangible results both in theory and in practice. For path planning, new algorithms for large-scale problems are devised and implemented and integrated into the Robot Operating System (ROS). The book also discusses the parallelism advantage of cloud computing techniques to solve the path planning problem, and, for multi-robot task allocation, it addresses the task assignment problem and the multiple traveling salesman problem for mobile robots applications. In addition, four new algorithms have been devised to investigate the cooperation issues with extensive simulations and comparative performance evaluation. The algorithms are implemented and simulated in MATLAB and Webots.
Caracteristici
Includes recent research on robot path planning and cooperation Presents foundations, algorithms, and experimentations Includes various examples and applications