发明名称 Method for efficient dynamic allocation of vehicles to independent passengers
摘要 The present invention may enable the efficient allocation of a plurality of vehicles (300) to a plurality of passengers (100) traveling between independent origins and destinations. In one or more embodiments, the method may collect the locations of vehicles (300), and the origins and destinations of traveling parties (100). The method may generate a set of routes that it deems superior to other known sets of routes, making use of an electronic map (202), which may provide street lengths, estimated travel times, and estimated costs along streets.
申请公布号 US9293048(B2) 申请公布日期 2016.03.22
申请号 US201414161686 申请日期 2014.01.23
申请人 发明人 Fowler Eric Alan
分类号 G01C21/34;G06Q10/04;G08G1/00 主分类号 G01C21/34
代理机构 代理人
主权项 1. A method for allocating vehicles to persons desiring transportation, the method comprising: a) wirelessly communicating vehicle information from at least one vehicle console to at least one dispatch unit, each said vehicle console being borne by a vehicle with a driver, and each said vehicle being suitably equipped for transporting persons, wherein said vehicle information including: i. a fitness or availability of said vehicle for service,ii. a location of said vehicle, andiii. an embarkation or disembarkation of traveling parties on or from said vehicle, and b) routing said vehicles by at least one dispatch unit, each said dispatch unit including: i. a non-transitory computer-readable storage device storing instructions for controlling a computing environment to perform a method in a computing system for generating routes of transportation of travelers with known origins and destinations, said route generating method comprising: (1) receiving street information from an electronic map, said electronic map covering the area occupied by said traveling parties and by said vehicles, and said street information including: (a) locations of intersections, and locations of endpoints of accessible ways, and(b) locations of accessible ways between said intersections and said endpoints of said accessible ways, and(c) at least one travel metric, each said travel metric being calculated along said accessible ways,(2) generating at least one feasible route, each said feasible route comprising: (a) information designating at least one party of travelers, each designated party of travelers being referred to hereinafter as an included party,(b) information designating one of said vehicles as a carrying vehicle for said feasible route,(c) the location of said carrying vehicles, and(d) one sequential set or more than one sequential set, said sequential set including said origins and said destinations of said included parties and said location of said carrying vehicle, and said sequential set optionally excluding any origins of any included parties that have previously been embarked upon, but not disembarked from, said carrying vehicle, and each said sequential set having the properties that: i. any vehicle transiting said feasible route shall transit every said origin and every said destination in said sequential set, and said vehicle shall never transit any said destination of any included party prior to transiting an origin of the same included party, and ii. each said included party that has previously embarked upon, but not disembarked from, a particular vehicle shall be included only in a sequential set that designates said particular vehicle as the carrying vehicle for that sequential set,(3) generating a plurality of route sets, each said route set comprising at least one feasible route, and each said route set having the properties that: (a) each of said parties of travelers are included in at most one feasible route within said route set, and(b) each of said carrying vehicles are included in at most one feasible route within said route set, and(c) each said feasible route within said route set shall include at least one of said traveling parties,(4) selecting one of said route sets as superior to the other generated route sets, and(5) extracting each said feasible route from said selected route set, and c) wirelessly communicating travel directions to each said vehicle console borne by said vehicle associated with said extracted feasible route, said travel directions including said information designating said included parties as included in said extracted feasible route, and d) dispatch said carrying vehicle to embark each said included party at the origin of said included party, to transport said included party to the destination of said included party, to disembark said included party at said destination of said included party, and to communicate the facts of said embarkations and disembarkations to said dispatch unit, e) wherein said superior route set is selected on the basis of least total predicted passenger travel cost for all included parties in said superior route set, said total predicted passenger travel cost comprising the sum of predicted passenger travel costs for each of the passengers in each of the traveling parties included in said superior route set.
地址