Complete Path Planning for a Tetris-Inspired Self-Reconfigurable Robot by the Genetic Algorithm of the Traveling Salesman Problem

Complete Path Planning for a Tetris-Inspired Self-Reconfigurable Robot by the Genetic Algorithm of the Traveling Salesman Problem

The efficiency of autonomous systems that tackle tasks such as home cleaning, agriculture harvesting, and mineral mining depends heavily on the adopted area coverage strategy. Extensive navigation strategies have been studied and developed, but few focus on scenarios with reconfigurable robot agents...

Full description

Bibliographic Details
Main Authors: Anh Vu Le, Manimuthu Arunmozhi, Prabakaran Veerajagadheswar, Ping-Cheng Ku, Tran Hoang Quang Minh, Vinu Sivanantham, Rajesh Elara Mohan
Format: Article
Language:English
Published: MDPI AG 2018-11-01
Series:Electronics
Subjects:
motion planning
cleaning robot
reconfigurable system
energy saving
area coverage
genetic algorithm
Online Access:https://www.mdpi.com/2079-9292/7/12/344

Internet

https://www.mdpi.com/2079-9292/7/12/344

Similar Items