Method for the optimized transportation of passengers or objects

Abstract

The vehicles are moved in continuous manner in the same direction, on orders of a computer given only before their departure, fixing an itinerary optimized as a function of the congestion anticipated at each section of the network. The network comprises several one-way closed circuit routes, having common zones between convergent and divergent stretches, wherein each of said routes is traversed in one-way sense by guide-marking elements having between themselves, a controlled spacing called the pitch. In the zone common to any two of the routes, the marking elements have the same direction with an interconnected pitch P and speed V, and are shifted in the common zone, from one route to the other, and serve as pilots for the vehicles keyed on them by a servo system during their passage over one route. The vehicles possess a device permitting possible changing of the line of marking elements (hence of the route). A counter is fixed at the exit from each divergent stretch to detect the position of the vehicles with respect to the marking elements of each route, then to control the servo system for resetting the keying (distribution) of the vehicles on said marking elements. Fixed signals (pins) enable the execution at a suitable moment according to a defined program, of the order to change line of marking elements, at the same time as the order for changing routes. The routes have also means for executing the order of possible rekeying of the vehicle, given by the counter.