Abstract
ABSTRACTNowadays transportation represents an important field for CPS applications due to the rapid development of highly automated or autonomous vehicles, e.g. warehouse vehicles, airport people movers, public transport, etc. These vehicles are usually designed to circulate on fixed routes independently of the actual state of the network in order to fulfil a given criterion, such as traveling on the shortest path or including scheduled stops. This paper introduces a routing approach that allows automated vehicles to travel on different paths between given points, minimising the generalised cost of the route. Between fixed points, which can be either different storage points in a warehouse or simply public transport stops, possible routes are modelled as a continuously updated weighted directed graph. The weights represent relevant parameters of links, collected from surrounding sensors and monitoring systems of the network. Route optimisation is done by Yen’s algorithm depending on the timetable: if the vehicle will reach the next stop on time, the alternative with the lowest generalised cost is chosen; else the fastest route is followed. The method is introduced specifically via the problem of traffic congestion on public transport paths, but can be generalised, e.g. any transport system within factories or warehouses.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: International Journal of Computer Integrated Manufacturing
Disclaimer: 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.