Multi-robot routing and scheduling with temporal logic and synchronization constraints

5Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We consider the problem of scheduling and planning the motion of a fleet of robots involved in semiconductor manufacturing. The robots are tasked with transporta-tion demands of goods that must be fulfilled according to given time constraints and synchronization rules. The de-mands and synchronization rules are specified using Time Window Temporal Logic (TWTL). Inspiring by model checking techniques, we develop a solution able to guar-antee to satisfy both demands and synchronization rules. The proposed approach is tested through simulation on a semiconductor production site of the European project "Power Semiconductor and Electronics Manufacturing 4.0-(SemI40)".

Cite

CITATION STYLE

APA

Mosca, A., Vasile, C. I., Belta, C., & Raimondo, D. M. (2019). Multi-robot routing and scheduling with temporal logic and synchronization constraints. In ACM International Conference Proceeding Series (pp. 40–45). Association for Computing Machinery. https://doi.org/10.1145/3387304.3387322

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free