A MILP Scheduling Problem for Multi-Robot Logistics Systems in a Precision Farming Application and a Polynomial Time Optimal Algorithm.
Antonio FurchìMauro FranceschelliAndrea GasparriPublished in: MED (2024)
Keyphrases
- multi robot
- dynamic programming
- optimal solution
- worst case
- path planning
- computational complexity
- scheduling problem
- np hard
- objective function
- mobile robot
- real time
- expectation maximization
- strongly np hard
- video surveillance
- recognition algorithm
- flowshop
- single machine
- multi robot systems
- vision system
- multi robot exploration