#7571. Automatic task scheduling optimization and collision-free path planning for multi-areas problem

October 2026publication date
Proposal available till 20-05-2025
4 total number of authors per manuscript0 $

The title of the journal is available only for the authors who have already paid for
Journal’s subject area:
Computational Mechanics;
Engineering (miscellaneous);
Mechanical Engineering;
Artificial Intelligence;
Places in the authors’ list:
place 1place 2place 3place 4
FreeFreeFreeFree
2350 $1200 $1050 $900 $
Contract №7571.1 Contract №7571.2 Contract №7571.3 Contract №7571.4
1 place - free (for sale)
2 place - free (for sale)
3 place - free (for sale)
4 place - free (for sale)

Abstract:
Automatic task scheduling and collision-free path planning for multi-task optimization is a great challenge in various industrial applications. It is a typical coupling problem between task sequence optimization and collision-free path planning. Task visited sequence, task region entry point optimization, and task switching collision-free path planning should be considered for trade-offs. This paper presents a novel automatic approach to solve task scheduling and collision-free path planning for the multi-areas problem.
Keywords:
Collision-free; Multi-areas; Optimization; Path planning; Task scheduling

Contacts :
0