A TRAFFIC PLANNING METHOD FOR A VEHICLE FLEET

• Main Authors: HELLGREN, Jonas, KOJCHEV, Stefan
• Format: Patent
• Language: English; French; German
• Published: 30.07.2025
• Subjects: CALCULATING; COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS; COMPUTING; CONJOINT CONTROL OF VEHICLE SUB-UNITS OF DIFFERENT TYPE ORDIFFERENT FUNCTION; CONTROL SYSTEMS SPECIALLY ADAPTED FOR HYBRID VEHICLES; COUNTING; DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FORADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORYOR FORECASTING PURPOSES; PERFORMING OPERATIONS; PHYSICS; ROAD VEHICLE DRIVE CONTROL SYSTEMS FOR PURPOSES NOT RELATED TOTHE CONTROL OF A PARTICULAR SUB-UNIT; SIGNALLING; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE,COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTINGPURPOSES, NOT OTHERWISE PROVIDED FOR; TRAFFIC CONTROL SYSTEMS; TRANSPORTING; VEHICLES IN GENERAL

A computer-implemented traffic planning method (100) for controlling a plurality of vehicles which are movable among multiple shared resources, comprising:receiving (no) a transport mission;generating (112) a root node representing an initial resource occupancy of the vehicles;sequentially generating (114) a search tree from the root node, in which each edge represents a motion command and each node represents a resource occupancy, wherein each node is associated with a score including an anticipated reward for fulfilling the transport mission;identifying (116) a target node with an acceptable score; andderiving (118) a planned sequence of motion commands corresponding to a path to the target node, wherein:child nodes of a leaf node are generated (114.4) subject to a tree-expansion criterion (114.2);a reward is assigned (114.6) to a child node if the transport mission is fulfilled; andan anticipated value of the assigned reward is added (114.8) to all parent nodes.