Books > Professional & Technical > Electronics & communications engineering > Electronics engineering > Automatic control engineering > Robotics
|
Buy Now
Robot Path Planning and Cooperation - Foundations, Algorithms and Experimentations (Paperback, Softcover reprint of the original 1st ed. 2018)
Loot Price: R4,693
Discovery Miles 46 930
|
|
Robot Path Planning and Cooperation - Foundations, Algorithms and Experimentations (Paperback, Softcover reprint of the original 1st ed. 2018)
Series: Studies in Computational Intelligence, 772
Expected to ship within 10 - 15 working days
|
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.
General
Is the information for this product incomplete, wrong or inappropriate?
Let us know about it.
Does this product have an incorrect or missing image?
Send us a new image.
Is this product missing categories?
Add more categories.
Review This Product
No reviews yet - be the first to create one!
|
|
Email address subscribed successfully.
A activation email has been sent to you.
Please click the link in that email to activate your subscription.