Abstract
Abstract The control of a number of vehicles moving simultaneously in a rectangular area is considered. Each vehicle performs a set of transportation operations. The aim of control is to perform all operations in a shortest possible time, avoiding any collisions with other vehicles and constant obstacles. The approximate algorithm was developed which uses a heuristic search of state-space graphs. The conclusion from a number of experiments is that the algorithm is able to find a near-optimal solution. If a great number of vehicles moves simultaneously, the computation time becomes significant. For this reason a modified algorithm was developed. It is faster while the decrease of the control quality is relatively small.
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.
