TY - GEN
T1 - Multi-objective heuristics applied to robot task planning for inspection plants
AU - Landa-Torres, Itziar
AU - Lobo, Jesus L.
AU - Murua, Idoia
AU - Manjarres, Diana
AU - Del Ser, Javier
N1 - Publisher Copyright:
© 2017 IEEE.
PY - 2017/7/5
Y1 - 2017/7/5
N2 - Robotics are generally subject to stringent operational conditions that impose a high degree of criticality on the allocation of resources and the schedule of operations in mission planning. In this regard the so-called cost of a mission must be considered as an additional criterion when designing optimal task schedules within the mission at hand. Such a cost can be conceived as the impact of the mission on the robotic resources themselves, which range from the consumption of battery to other negative effects such as mechanic erosion. This manuscript focuses on this issue by presenting experimental results obtained over realistic scenarios of two heuristic solvers (MOHS and NSGA-II) aimed at efficiently scheduling tasks in robotic swarms that collaborate together to accomplish a mission. The heuristic techniques resort to a Random-Keys encoding strategy to represent the allocation of robots to tasks whereas the relative execution order of such tasks within the schedule of certain robots is computed based on the Traveling Salesman Problem (TSP). Experimental results in three different deployment scenarios reveal the goodness of the proposed technique based on the Multi-objective Harmony Search algorithm (MOHS) in terms of Hypervolume (HV) and Coverage Rate (CR) performance indicators.
AB - Robotics are generally subject to stringent operational conditions that impose a high degree of criticality on the allocation of resources and the schedule of operations in mission planning. In this regard the so-called cost of a mission must be considered as an additional criterion when designing optimal task schedules within the mission at hand. Such a cost can be conceived as the impact of the mission on the robotic resources themselves, which range from the consumption of battery to other negative effects such as mechanic erosion. This manuscript focuses on this issue by presenting experimental results obtained over realistic scenarios of two heuristic solvers (MOHS and NSGA-II) aimed at efficiently scheduling tasks in robotic swarms that collaborate together to accomplish a mission. The heuristic techniques resort to a Random-Keys encoding strategy to represent the allocation of robots to tasks whereas the relative execution order of such tasks within the schedule of certain robots is computed based on the Traveling Salesman Problem (TSP). Experimental results in three different deployment scenarios reveal the goodness of the proposed technique based on the Multi-objective Harmony Search algorithm (MOHS) in terms of Hypervolume (HV) and Coverage Rate (CR) performance indicators.
UR - http://www.scopus.com/inward/record.url?scp=85028505752&partnerID=8YFLogxK
U2 - 10.1109/CEC.2017.7969496
DO - 10.1109/CEC.2017.7969496
M3 - Conference contribution
AN - SCOPUS:85028505752
T3 - 2017 IEEE Congress on Evolutionary Computation, CEC 2017 - Proceedings
SP - 1621
EP - 1628
BT - 2017 IEEE Congress on Evolutionary Computation, CEC 2017 - Proceedings
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2017 IEEE Congress on Evolutionary Computation, CEC 2017
Y2 - 5 June 2017 through 8 June 2017
ER -