Abstract
This technical note is about trajectory tracking for discrete event systems. The main contribution is to compute incrementally control sequences with minimal or near-minimal length based on a partial exploration of the Petri net (PN) reachability graph and inspired by the model predictive control approach. The method is suitable for bounded and unbounded PNs, for PNs with weighted arcs and with some uncontrollable transitions. Finally forbidden markings or regions of markings are easily avoided with the proposed approach that can be used for supervisory control issues.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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 call
