Abstract
This research proposes an automated method for planning a team of mobile robots such that a Boolean-based mission is accomplished. The specification consists of logical requirements over some regions of interest for the agents' trajectories and for their final states. A Petri net (PN) with outputs models the movement capabilities of the team and the active regions of interest. The imposed specification is translated to a set of linear restrictions for some binary variables, the robot movement capabilities are formulated as linear constraints on PN markings, and the evaluations of the binary variables are linked with PN markings via linear inequalities. This allows us to solve a Mixed Integer Linear Programming problem whose solution yields robotic trajectories satisfying the task.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
