.png){kind=icon}
.png){kind=icon}
Return
Optimization of Robotic Task Sequencing Problems by Crowding Evolutionary Algorithms
.png){kind=icon}
PRE
AI
DOI：10.1109/TSMC.2021.3104862.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This study solved the robotic task sequence planning problem of scheduling joint-space tours so that each task point visit is made according to expected manufacturing criteria. Multiple solutions for robotic inverse kinematic (RIK) problems were obtained for two task sequencing problems: 1) preset manufacturing sequence planning (Preset-MSP) and 2) optimal manufacturing sequence planning (Opt-MSP). First, a real-coded twin-space crowding evolutionary algorithm (TC-EA) was developed and used to explore multiple RIK joint configurations for each task point. Then, a heuristic bidirectional reference mechanism (BRM) was developed and used for efficiently solving Preset-MSP problems. By integrating BRM, the proposed discrete-coded TC-EA also efficiently solved Opt-MSP problems. To validate the proposed approach, multiple multimodal benchmark functions and task sequencing test cases were used to compare the solving capability of the proposed TC-EA and other evolutionary multimodal solvers. The experimental results showed that the proposed methods obtained better or at least comparable solutions for all test problems. For decision makers, the proposed methods have practical applications for exploring and comparing multiple robotic manufacturing plans.
Keywords:
Robots
Manufacturing
Task analysis
Planning
Sequential analysis
Mathematical model
Robot kinematics
Evolutionary algorithm (EA)
inverse kinematics
robotic manufacturing
task sequence planning
Journal
IF:
10.5
Papers:
1.1W
Citations:
5.0W