System and method for predicting a vehicle route using a route network database

Information

  • Patent Grant
  • 8725326
  • Patent Number
    8,725,326
  • Date Filed
    Thursday, January 5, 2012
    12 years ago
  • Date Issued
    Tuesday, May 13, 2014
    10 years ago
Abstract
A system and method for predicting a route to be authorized by a dispatcher for a vehicle to travel on a route network comprises a computer system that has a database having stored data relative to interconnecting route segments that make up the route network. Data relative to the origination location and the destination location is input into the computer system. The processor accesses the database and generates a predicted route with an origination location and destination location.
Description
BACKGROUND

One or more embodiments of the inventive subject matter described herein relate to a powered system, such as a train, an off-highway vehicle, a marine, a transport vehicle, or an agriculture vehicle, such as a method and/or computer software code for improved fuel efficiency, emission output, vehicle performance, infrastructure, and/or environment mission performance of the powered system. Additionally, the presently described inventive subject matter relates to systems or methods that are used to determine a route a vehicle is to follow on a road, track, or route network. At least one embodiment, relates to systems or methods that utilize data relative to a route networks to predict, and if necessary adapt, a predicted route to optimize fuel efficiency during a planned trip or mission of the vehicle.


Some powered systems such as, but not limited to, off-highway vehicles, marine diesel powered propulsion plants, transport vehicles such as transport buses, agricultural vehicles, and rail vehicle systems or trains, typically are powered by one or more power units, such as diesel-fueled power generating units. With respect to rail vehicle systems, a power or powered unit is usually a part of or represents at least one locomotive powered by at least one internal combustion engine (e.g., a diesel engine) and the rail vehicle system further includes a plurality of non-powered units, such as rail cars (e.g., freight cars). More than one powered unit can be provided where the powered units are considered part of a consist.


An operator is usually aboard a powered unit to insure the proper operation of the powered unit, and when there is a consist of the powered units, the operator is usually aboard a lead powered unit. A powered unit consist is a group of powered units that operate together in operating (e.g., propelling) a vehicle, such as a rail vehicle, that includes the powered unit. In addition to ensuring proper operations of the powered unit or powered unit consist, the operator also is responsible for determining operating speeds of the vehicle and forces within the vehicle that the powered units are part of. To perform this function, the operator generally has experience with operating the powered unit and various vehicles over the specified terrain. This knowledge is used to comply with prescribeable operating parameters, such as speeds, emissions, and the like, that may vary with the location of the vehicle along a route. Moreover, the operator can be responsible for assuring in-vehicle forces (e.g., coupling forces between neighboring cars and/or locomotives in a train) remain within acceptable limits.


In marine applications, an operator can be aboard a marine vehicle to insure the proper operation of the vessel, and when there is a vessel consist, the lead operator may be aboard a lead vessel. As with the example described above, a vessel consist can include a group of vessels that operate together in operating a combined mission or trip. In addition to ensuring proper operations of the vessel, or vessel consist, the lead operator can be responsible for determining operating speeds of the consist and forces within the consist of which the vessels are part. To perform this function, the operator has experience with operating the vessel and various consists over the specified waterway or mission. This knowledge is used to comply with prescribeable operating speeds and other mission or trip parameters that may vary with the vessel location along the mission. Moreover, the operator is may ensure mission forces (e.g., forces between the vessels) and location remain within acceptable limits.


In the case of multiple diesel power powered systems, which by way of example and limitation, may reside on a single vessel, power plant, vehicle, or power plant sets, an operator may be in command of the overall system to ensure the proper operation of the system, and when there is a system consist, the operator may be onboard a lead system. Defined generally, a system consist includes a group of powered systems that operate together in meeting a mission. In addition to ensuring proper operations of the single system, or system consist, the operator can be responsible for determining operating parameters of the system set and forces within the set of which the system is a part. To perform this function, the operator can have experience with operating the system and various sets over the specified space and mission. This knowledge is used to comply with prescribeable operating parameters and speeds that may vary with the system set location along the route. Moreover, the operator can be responsible for ensuring that in-set forces (e.g., forces between different components of the set) remain within acceptable limits.


However, with respect to a powered unit (e.g., a locomotive), even with knowledge to assure safe operation, the operator may be unable to operate the powered unit so that the fuel consumption is minimized or reduced for each trip. For example, other factors that must be considered may include emission output, environmental conditions (e.g., noise/vibration, a weighted combination of fuel consumption and emissions output, and the like). This can be difficult to do since, as an example, the size and loading of vehicles can vary, powered units and the associated fuel/emissions characteristics can be different, and/or weather and traffic conditions can vary over the course of a trip.


A vehicle owner may own a plurality of vehicles (e.g., trains) where the vehicles operate over a network of routes (e.g., railroad tracks). Because of the integration of multiple vehicles running concurrently within the network of such routes, scheduling issues may be considered with respect to vehicle operations, the owners could benefit from a way to improve fuel efficiency and emission output so as to save on overall fuel consumption while reducing emission output of multiple vehicles while meeting time constraints on the mission or trip.


Likewise, owners and/or operators of off-highway vehicles, transportation vehicles, agricultural vehicles, marine powered propulsion plants, and/or stationary diesel powered systems may realize financial benefits when such powered systems have increased fuel efficiency, reduced emission output, improved fleet efficiency, and/or improved mission parameter performance so as to save on overall fuel consumption while reducing emission output and meeting operating constraints, such as but not limited to mission or trip time constraints.


Transportation networks (e.g., railways) are relatively complex systems that can include an extensive network of routes (e.g., railroad tracks) having multiple vehicles concurrently operating or traveling on the routes at any given time. The transportation network can be divided into multiple regions with a dispatcher assigned to monitor the movement of vehicles in a respective region of the network. When an operator (e.g., engineer) on a vehicle (e.g., train) is ready operate and move a vehicle on a transportation network, the engineer can call the dispatcher and identify the vehicle to announce the vehicle is prepared to start. Taking into account various factors such as network routing rules, origin and/or destination of the vehicle, speed restrictions and maintenance locations, and the like, the dispatcher develops a route that is divided into multiple route segments.


Usually, the route segments are generated in about fifteen to thirty mile increments. Signals from the dispatch center are transmitted to route field equipment such as signal lights, switches, etc. The field equipment is activated to essentially define a segment of the route the vehicle is following. For example, switches may be activated to move the vehicle to another route, or signals may be generated that are representative of the route that the vehicle is traveling on and/or the speed limit for one or more sections of the route. In response to the field equipment signals and/or in response to verbal commands of the dispatcher, the engineer or operator of the vehicle can control the speed of the vehicle on the route.


The engineer or operator may be concerned with the speed that the vehicle is traveling on the route and arriving at the destination at a desired (e.g., scheduled) time. During the course of the trip, an engineer or operator may make decisions to either slow the vehicle, or increase the power output or speed of the vehicle. Some of these decisions may be dictated solely on the engineer or operator seeing that the vehicle arrives at its destination on time. Accordingly, these decisions may compromise fuel consumption of the vehicle and powered units of the vehicle.


Some railroads have incorporated at dispatch stations movement planner systems for controlling the movement of a plurality of rail vehicles on a track network. Dispatch stations may use these systems to configure segments of a train route. As described above, only segments of the entire route are communicated to the track field equipment, responsive to which the engineer manually or a train controller automatically controls the speed of the train.


Presently, there is no known system or method disposed onboard a powered unit of a vehicle or on the vehicle for predicting an entire route of the vehicle from an origin (e.g., scheduled departure location or a current location on route to a destination location) to a destination (e.g., a final location of a trip or an intermediate location on the way to the final location of the trip). Additionally, there is no known system or method that considers the existing rules of the routes to be traveled on and/or other factors in predicting a route of the vehicle to a destination. Moreover, there is no known system or method that predicts a route of a vehicle (which may involve considering the existing rules of the route) to develop a fuel efficient throttle position strategy for travel of the vehicle from origin to destination.


BRIEF DESCRIPTION

The presently described inventive subject matter describes a system that is onboard a vehicle and is used for predicting a route to be traveled by the vehicle using a route network database. A computer system, having a memory, is linked to one or more vehicles in a fleet of vehicles that follow one or more routes in a route network and the routes are determined by one or more dispatchers. In an embodiment, the computer system may be onboard the vehicle. A database is stored in the memory and comprises data representative of information of the route network including a series of interconnected route segments and a set of routing rules followed by the dispatcher for determining an authorized route the vehicle shall follow. The routing rules include speed restrictions for each route segment. In an embodiment used with trains and locomotives, the database may include a track network made of interconnecting track segments and locations of stations in the track network and the track segments at the stations for entering and exiting a station.


An input mechanism may be provided for inputting data representative of an origination location of the vehicle and one or more destinations of the vehicle. In addition, temporary speed restrictions and route maintenance schedules are entered. A processor in the computer system can be programmed with a route generation algorithm to take the data representative of the origination location and destination location of the vehicle, and access the database to generate a predicted route that is a prediction of a route that a dispatcher may authorize according to the set of routing rules for the vehicle to follow from the origination location to the destination location. In one embodiment, a predicted route may include the identification of each route segment the vehicle is to travel on and the speed at which vehicle is to travel for each route segment.


In one embodiment, the processor is configured to change the predicted route if the vehicle diverges onto an off-route segment. Data representative of the authorized route the vehicle is following, or data representative of route segments the vehicle will follow, is received by the processor to change the predicted route to an alternate predicted route in the event the vehicle diverges or will diverge from a route segment on the predicted route to an off-route segment, the alternate predicted route defined by a starting location, which is the off-route segment, and the destination.


In another embodiment, the system and method are implemented as a component of a routing system that is used to “optimize” the efficiency of fuel consumption and/or “minimize” the emission output or travel time of the vehicle by factoring operation and physical characteristics of the vehicle and physical characteristics of the route segments. As used herein, the term “optimize” and various forms thereof is intended to mean that a characteristic, parameter, condition, output, and the like, is improved, but not necessarily maximized or minimized (although optimizing may include such maximizing or minimizing). For example, optimizing fuel efficiency or emissions generation may mean increasing the fuel efficiency of a vehicle or reducing the emissions generated by the vehicle, but not necessarily achieving the greatest possible fuel efficiency or the lowest possible emissions generated. Additionally, as used herein, the terms “maximize” and “minimize” and various forms thereof are intended to mean that a characteristic, parameter, condition, output, and the like, is increased or decreased, respectively, but not necessarily maximized or minimized to the greatest or smallest possible value. For example, maximizing fuel efficiency or minimizing fuel consumption may mean decreasing the amount of fuel consumed by the vehicle, but not necessarily eliminating all fuel consumed by the vehicle.


By predicting the authorized route the vehicle, the computer system develops a strategy for controlling the speed of the vehicle according to the predicted route instead of reacting to the signals received from route field equipment that defines segments of the route.





BRIEF DESCRIPTION OF THE DRAWINGS


FIG. 1 is a schematic illustration of a hardware configuration for at least one embodiment of the inventive subject matter disposed onboard a powered unit of a vehicle, such as onboard a locomotive.



FIG. 2 is a schematic illustration of a region of a route network.



FIG. 3 is a flow chart of a method for practicing one or more embodiments of the inventive subject matter described herein.



FIG. 4 is a flow chart continued from the flow chart shown in FIG. 3.





DETAILED DESCRIPTION

Before describing in detail the particular method and apparatus predicting a vehicle route in accordance with the presently described inventive subject matter, it should be observed that one or more embodiments of the inventive subject matter may reside in a novel combination of hardware and/or software elements related to the method and apparatus. Accordingly, the hardware and software elements have been represented by conventional elements in the drawings, showing only those specific details that are pertinent to one or more embodiments of the presently described inventive subject matter.


Though one or more example embodiments are described herein with respect to rail vehicles, or railway transportation systems (e.g., trains and locomotives having diesel engines or locomotives powered by electricity), one or more embodiments of the inventive subject matter are applicable for other uses or vehicles, such as, but not limited to, other off-highway vehicles, marine vessels, stationary units, agricultural vehicles, transport buses, and the like, one or more of which may use at least one engine (e.g., a diesel engine) or internal combustion engine (e.g., diesel internal combustion engine). Toward this end, when discussing a specified mission, the term “mission” may include a task or requirement to be performed by a powered system of a vehicle. Therefore, with respect to railway, marine, transport vehicles, agricultural vehicles, or off-highway vehicle applications, the term “mission” may refer to the movement of the powered system from a present location to a destination. Furthermore, though diesel powered systems are disclosed, one or more embodiments described herein may be utilized with non-diesel powered systems, such as but not limited to natural gas powered systems, bio-diesel powered systems, and the like. Furthermore, as disclosed herein, such non-diesel powered systems, as well as diesel powered systems, may include multiple engines, other power sources, and/or additional power sources, such as, but not limited to, battery sources, voltage sources (such as but not limited to capacitors), chemical sources, pressure based sources (such as but not limited to spring and/or hydraulic expansion), current sources (such as but not limited to inductors), inertial sources (such as but not limited to flywheel devices), gravitational-based power sources, and/or thermal-based power sources.


Additionally, although reference is made to an onboard processor or computer system, one or more functions of the presently described inventive subject matter may be performed by off-board computer systems that are linked to one or more vehicles in a fleet of vehicles while located off (e.g., “remote”) of the vehicles.


With respect to FIG. 1, there is schematically illustrated a vehicle 10 with a powered unit 12 and a plurality of non-powered units 24. The vehicle 10 is shown as a train having a locomotive as the powered unit 12, but alternatively may be another type of rail vehicle or another type of vehicle that does not travel solely on tracks or rails. The powered unit 12 is a vehicle capable of self-propulsion (e.g., a locomotive) and the non-powered units 24 are vehicles that are not capable of self-propulsion (e.g., railcars). The vehicle 10 may also have one or more remote powered units dispersed among the non-powered units 24. The powered unit 12, such as the lead powered unit in the vehicle 10 if there also are remote powered units, is equipped with an onboard computer system 14 that has a database 18 and a processor 16 for processing data in the database 18. Additionally, the powered unit 12 may have an onboard an input mechanism 20 for entering data in the controller 14, which data is processed using data in the database to generate a predicted vehicle route. The input mechanism may also include on off-board server based system 22 that transmits data to the controller 14 to generate the predicted vehicle route.


That database 18 has data stored in a memory, which data is related to a route network (e.g., a railroad track network) comprising a series of route segments (e.g., track segments) and data representative of routing rules (e.g., railroad routing rules) used by dispatchers to formulate vehicle routes. The term “dispatcher” as used in this specification and in the claims shall include not only human dispatchers but also any automated systems that perform dispatcher functions. Additionally, data representative of the location of dispatch stations along the route network or route segments may be stored in the database 18 including the identity of the different station routes for entering and exiting the station. More specifically, the route network data can include a route identifier and/or a route segment identifier for each route segment within a route. With reference to FIG. 2, there is a schematic of plurality of interconnected route segments that represent a route region 32 within a route network. A single route region may literally contain hundreds of route segments, and the simplified region shown in FIG. 2 is provided for convenience in describing one or more aspects of the presently described inventive subject matter. As illustrated, the different route segments are designated RS1, RS2, RS3, and the like. As noted above, the data in database 18 can include route identifier data. For example, a route identified as route 110 (see Table I) includes route segments RS1, RS2, RS4, RS5, and RS8. The database 18 may also include a route segment length for one or more of the route segments, which may be used to calculate the overall distance of the vehicle route.


The route network can be divided into route regions which may correspond to route subdivisions (such as railroad track subdivisions), and one or more of these regions may be assigned an identifier. For one or more of the route regions, data representative of locations of stations within a respective region may be provided or stored. Additionally, for one or more of the station locations, there can be one or more routes that a vehicle may enter and exit a station location. These entry and/or exit routes can be identified with the station locations.


The database 18 may include route segment connecting data that identifies which route segments are connected to one another and/or the ends at which the route segments are connected. For example, one or more of the route segments may include a first end and second end, which can be identified as a high end and low end, respectively. In reference to FIG. 2, the low end of each of the illustrated route segments is the left end and the high end is the right end of each route segment. Where an end of a route segment is connected to two routes, each of the two routes connected with the route segment can be categorized as a primary or secondary connecting segment. For example, with reference to FIG. 2, the route segment RS4 has a low end primary connection to route segment RS2 (at the high end of RS2) and route segment RS4 has low end secondary connection to route segment RS3 (at the high end of RS3). Additionally, route segment RS4 has a high end primary connection to route segment RS5 (at the low end of RS5) and a high end primary connection to route segment RS6 (at the low end of RS6).


In addition to the foregoing data, the database 18 may also include data representative of switches in the route network. In reference to FIG. 2, switches are identified on the route 24 as SW1, SW2, SW3, and cross switches are identified as CS1 and CS2. The database may include data pertaining to the location of one or more of the switches representative of route segments. For example, switch SW2 (in the below table the switches are referred to as divergent devices) is located at the high end of route segments RS2 and RS3, and at the low end of the route segment RS4.


The database 18 may include data that is representative of routing rules. Such routing rules may include rules pertaining to a preferred or designated direction of travel by vehicles on one or more of the route segments. With respect to direction of travel, designations are assigned to the directions that indicate a direction in which there may be some cost benefit or a constraint. For example, the designation NEUTRAL can mean that the route or route segment may be traveled in either direction, or there is no benefit or constraint on travel in either direction. A designation of HIGHBOUND can mean that the designated or limited direction of travel is entering the route segment from a low end of the route segment and traveling toward the high end of the route segment. A designation of LOWBOUND can mean that the designated or limited direction is entering the route segment from a high end of the route segment and traveling toward the low end of the route segment. For example, in the below referenced table, the route segment RS6 has a designated direction of LOWBOUND which means, in reference to FIG. 2, that the designated or limited direction of travel is from right to left on the route segment RS6. A designation of AVOID can mean that the route segment should be avoided if at all possible. This may be appropriate for siding routes in a route network, such as siding rails in a track network.


The database 18 may include weight restrictions of vehicles, such as non-powered units, representative of one or more of the route segments in the route network. The database 18 may include data representative of restrictions on the length of a vehicle, restrictions on the width (or other size) of the vehicle (e.g., the powered units and/or non-powered units), or restrictions on the type of cargo (e.g., hazardous materials) representative of one or more of the route segments in the route network. These restrictions may prohibit or limit the travel of some vehicles over associated route segments.


The above referenced data representative of route segments and switching equipment for the route segments shown in FIG. 2 are set forth in the below table:











TABLE I









Route Segment ID

















RS1
RS2
RS3
RS4
RS5
RS6
RS7
RS8
RS9




















Route ID
110
110
111
110
110
112
113
110
112


Segment
14,695
12,786
12,347
19,808
22,264
22,743
550


Length


HighEnd
RS2
RS4
RS4
RS5
RS8
RS9
RS9
0
0


Primary


Connecting


Segment


HighEnd
RS3
0
0
RS6
RS7
0
0
0
0


Secondary


Connecting


Segment


HighEnd
SW1
SW2
SW2
SW3
CS1
CS2
CS2
0
0


Divergent


Device


LowEnd
0
RS1
RS1
RS2
RS4
RS4
RS5
RS5
RS6


Primary


Connecting


Segment


LowEnd
0
0
0
RS3
0
0
0
0
RS7


Secondary


Connecting


Segment


LowEnd
0
SW1
SW1
SW2
SW3
SW3
CS1
CS1
CS2


Divergent


Device


Designated
NEUTRAL
NEUTRAL
AVOID
NEUTRAL
HIGHBOUND
LOWBOUND
NEUTRAL


Direction









With reference to FIGS. 1, 2 and 3, and the above-referenced Table I, there is now described a method for predicting a vehicle route. In FIG. 3, one embodiment of a flow chart for the method is illustrated. At 40, data representative of identification of the powered unit 12 and/or the vehicle 10 origination (or origin) and destination locations for a vehicle route are input into the onboard controller 14. Alternatively, the data may represent one or more intermediate locations (e.g., disposed between the origin and destination locations). Additionally, data representative of speed restrictions temporary speed restrictions) and/or data representative of scheduled route maintenance for one or more of the route segments between the origin to the destination are input into the onboard controller 14. The data may be entered via the input mechanism 20 and/or the off-board server based system 22. In the case when an engineer or operator of the vehicle is preparing to travel on a route network, the engineer or operator can input an identification number of the vehicle or powered unit, and this information can be transmitted via signal 26 (shown in FIG. 1) to the server-based system 22, which then transmits the data representative of the origination location and/or destination location of the vehicle 10 via a signal 28 (shown in FIG. 1). As described above, the data representative of speed restrictions and/or scheduled route maintenance may also be included in this transmission.


At 42, when at least some of the above described data is entered the processor accesses the database 18 that includes the route network data, routing data or rules, and the station location information. Using the input data (step 40) entered at 42, at 44, the processor 16 generates a predicted vehicle route based on the origination and destination locations for the vehicle and/or powered unit 12. The controller 14 and/or processor 16 may utilize known software for developing train routes at dispatch stations. Routing through the network of route segments may be computed using one or more network routing algorithms, such as the well known Shortest Path First algorithm.


By way of first example, and in reference to FIG. 2 and Table I, an origination location of route segment RS1 and a destination location of route segment RS8 is entered in controller 14. The display 30, assuming there are no scheduled route maintenances, can show a predicted route from RS1 to RS2 to RS4 to RS5 to RS8. As shown in the Table I, the primary connecting route segment to RS1 is RS2, the primary connecting segment to RS2 is RS4 which also has a preferred direction of travel of NEUTRAL. So the vehicle can travel on RS1, RS2 and RS4 to RS5. The route segment RS5 has a designated direction of travel of HIGHBOUND so the vehicle can travel on RS5 to RS8 its destination.


In a second example, an origination location of RS9 and destination location of RS1 are entered in the controller 14. In reference to Table I, the route segment RS9 has a designated direction of travel in the LOWBOUND (e.g., right to left) direction. As shown in FIG. 2, both route segment RS6 and route segment RS7 are connected to the route segment RS9; however, the route segment RS6 has a designated direction of travel of LOWBOUND, which is selected over the NEUTRAL direction of the route segment RS7. The vehicle can then travel the connecting routes of RS4, RS2 and RS1 because of the NEUTRAL designated direction of travel of those route segments.


The system may include in the database 18, or in a separate accessible database, a list of previously predicted routes that a vehicle 10 has traveled so that, when the identification of the powered unit 12 and/or vehicle 10 with the origination and destination locations is made, the algorithm may match the powered unit 12 and/or the vehicle 10 with one or more of the previously predicted routes. When a previous predicted route is identified, a new predicted route may be generated using some or all of the previously predicted route as an initial route (or as a portion of the new predicted route), while factoring in updated restrictions such as temporary speed restrictions or route maintenance schedules. In this manner, the algorithm can be configured to reduce the amount of time required for the processor to generate a predicted route. In one embodiment, the previously predicted routes may be limited to those routes having been predicted within a predetermined time period (e.g., routes predicted within the past five days).


With respect to FIG. 4, in one embodiment, at 58, the predicted route may be sent from the powered unit 12 to the dispatcher. At 60, the dispatcher has the option to accept or reject the predicted route. If the dispatcher chooses not to accept the predicted route, the dispatcher can generate and provide an authorized route that is different than the predicted route at 62. Alternatively, at 64, the dispatcher may accept the predicted route and provide an authorized route that is the same as the predicted route. If necessary, the dispatcher may remotely activate switches according to the authorized predicted route so the vehicle can travel along the authorized predicted route. This embodiment may be effective for route networks experiencing light vehicle traffic, or it may be effective for such off highway route networks, such as shipping routes, that do not experience heavier traffic loads as in busier route networks.


One or more embodiments described herein may be configured as a component of a trip optimization or trip planner system or computer program that is used, for example, to improve or optimize fuel efficiency of the vehicle and/or reduce or minimize emissions output for a trip, as described in the above cross-referenced patent applications. One or more controllers may be configured to implement the trip planner system so that, when the predicted route is generated, the trip planner system generates a trip plan for all or a portion of the route. The trip plan may include operational settings (e.g., throttle positions, brake settings, speeds, power outputs, and the like) for the vehicle that are expressed as a function of at least one of time and/or distance along the trip. Traveling according to the trip plan may reduce the amount of fuel consumed, emissions generated by the vehicle, and/or travel time relative to traveling to one or more other plans.


Returning to the description of one embodiment of the method described herein, at 56, the controller 16 generates a trip plan (e.g., a throttle position strategy) that is computed using a trip optimization algorithm or a trip planning algorithm. Such an algorithm can factor in variables such as route grade, curvatures, and/or elevations to generate the trip plan that reduces fuel consumed and/or emissions generated by the vehicle. Additionally, characteristic data may be entered via the off board server-based system 22. This data may include the physical and performance data on one or more powered units, types or categories of the powered units and/or non-powered units, weights of the powered units and/or non-powered units, lengths of the powered units and/or non-powered units, cross sectional areas of the powered units and/or non-powered units, horsepower generated by the powered units, and/or other characteristics that may be considered in increasing fuel efficiency and/or reducing emissions generation. The vehicles may also be defined in the database with an identifier, speed limits or restrictions, and/or lists of powered unit types and/or non-powered unit types that may be included in the vehicles. In this manner, a trip plan for the vehicle route can be generated that provides one or more operational settings for one or more route segment and/or for defined distances over the route.


Again with reference to the route network data and as noted above, the route network data can be divided into regions, with one or more of the regions being a defined geographic entity of the route network. One or more of these regions may correspond to a vehicle subdivision, such as a railroad subdivision. To the extent that a vehicle route may cover more than one region of a route network, the predicted vehicle route may comprise a route for each of the regions covered in the vehicle route.


At 46, the controller may present (e.g., visually display) track information for a defined region within the predicted vehicle route on the display 30. The display 30 may present a speed limit for a predetermined distance on the predicted route, a designated operational setting (e.g., a designated speed limit) for a predetermined distance on the predicted route and that may be based on the trip plan described above, route grade and/or curvature information, and/or milepost or other landmark information


In one embodiment of the inventive subject matter described herein, the system and method are able to dynamically adapt the predicted route in the event the vehicle 10 diverges from the predicted route. At 50, the vehicle receives signals or input data relating to the authorized route from field equipment such as switches. These signals or input can identify the location of the vehicle 10 on the authorized route and/or identify where (e.g., which route segments) that the vehicle will be traveling over some predetermined distance


In the above first example of a predicted vehicle route, there is a switch SW1 connected to a high end of the route segment RS1 and a low end of the route segment RS3. The predicted vehicle route has the vehicle 10 travel on the route segment RS1 and then the route segment RS2. During the course of traveling on an authorized route, however, the vehicle 10 may receive a signal indicating that the switch SW1 is connecting the route segment RS1 to the route segment RS3, instead of to the route segment RS2. As the switch SW1 is not connected to the route segment RS2 (or the route segment RS3 is not part of the predicted route), at 52, the processor 16 identifies the divergence of route segment RS3 and, at 54, generates a new predicted route using the present location of the vehicle 10 and/or the track segment RS3 as the origination location to adapt the predicted route to include the track segment RS3. For example, the track segment RS3 may have different associated speed restrictions that cause the vehicle to reduce speed, or fewer constraints on speed that allow the vehicle 10 to increase speed. Additionally, the trip planner system can update the trip plan (e.g., throttle position strategy) for the new predicted vehicle route.


In another embodiment, the algorithm may be configured to reduce the time necessary to generate the new route when there is a divergence of the original predicted route. For example, if the vehicle 10 or computer system on the vehicle 10 determines that the vehicle 10 has or will diverge from the predicted route, the algorithm may be configured to identify the point at which the divergent route intersects the predicted route. In this manner, the algorithm may take the remaining segments in the predicted and simply copy the remaining route for generating the new route, instead of regenerating that remaining portion of the route.


While one or more embodiments of the inventive subject matter have been shown and described herein, these embodiments are provided by way of example and not of limitation on each and every embodiment. Numerous variations, changes and substitutions will occur to those of ordinary skill in the art without departing from the teaching of the presently described inventive subject matter. Accordingly, it is intended that the inventive subject matter be interpreted within the full spirit and scope of the appended claims.

Claims
  • 1. A system comprising: an input mechanism configured to be disposed onboard a powered vehicle and for receiving, from an off-board system disposed off of the vehicle, a designated location for the vehicle to travel toward in a route network; anda controller configured to be disposed onboard the vehicle and to receive the designated location from the input mechanism, the controller including a memory that is configured to store routing rules that restrict travel of the vehicle on one or more route segments of the route network,wherein the controller is configured to generate a predicted vehicle route for the vehicle to travel along toward the designated location based on the designated location received from the input mechanism, the controller also configured to send the predicted vehicle route to a dispatcher disposed off-board the vehicle for acceptance or rejection by the dispatcher, the controller further configured to receive, from the dispatcher, a first authorized route that is same as the predicted vehicle route when the dispatcher accepts the predicted vehicle route or receive, from the dispatcher, a second authorized route that is different from the predicted vehicle route when the dispatcher rejects the predicted route, the controller also configured to generate an alternate route for the vehicle to travel along toward the designated location when actual travel of the vehicle deviates from the first authorized route or the second authorized route, the alternate route being based on the routing rules and generated by the controller as the vehicle moves in the route network.
  • 2. The system of claim 1 wherein the routing rules include at least one of locations or positions of switches that couple two or more route segments.
  • 3. The system of claim 1 wherein the routing rules include a weight restriction associated with one or more of the route segments, the weight restriction indicating a limit on a weight of the vehicle traveling over the one or more route segments.
  • 4. The system of claim 1 wherein the input mechanism is configured to be coupled with the controller such that the controller receives the designated location from the input mechanism.
  • 5. The system of claim 1 wherein the route network includes one or more switches that couple two or more route segments, and the controller is configured to communicate the alternate route to an off-board system so that the off-board system can control positions of the switches to permit the rail vehicle to travel along the alternate route.
  • 6. The system of claim 1 wherein the routing rules include one or more speed restrictions or route maintenance schedules for one or more of the route segments.
  • 7. The system of claim 1 wherein the controller is configured to identify the route segments over which the vehicle is to travel in the alternate route in order to travel toward the designated location.
  • 8. The system of claim 1 wherein the controller is configured to provide one or more recommended speeds to travel on the alternate route to an operator on the vehicle.
  • 9. The system of claim 1 wherein the controller is configured to generate the alternate route when the vehicle diverges or will diverge from one or more route segments on the first authorized route or the second authorized route to an off-route segment, and wherein the alternate route is generated by connecting a current location of the vehicle to one or more of the route segments that interconnect the current location with the designated location.
  • 10. The system of claim 1 wherein input mechanism also is configured to receive a designated route for the vehicle to travel along toward the designated location from the off-board system, and wherein the alternate route includes a first route segment that intersects a second route segment of the designated route and a remaining portion of the designated route includes one or more common route segments as the alternate route, further wherein the controller is configured to copy the remaining portion of the designated route from the intersection toward the designated location to generate the alternate route.
  • 11. The system of claim 1 wherein the controller is configured to obtain data relative to one or more previously generated routes associated with the designated location and to select at least one of the previously generated routes as the alternate route.
  • 12. The system of claim 1 wherein the controller is configured to provide at least one of recommended speeds or throttle positions of the vehicle when following the alternate route, the at least one of recommended speeds or throttle positions determined in order to reduce at least one of fuel consumption, travel time, or emissions output of the vehicle as the vehicle travels toward the designated location according to the alternate route relative to traveling toward the designated location using other recommended speeds or throttle positions.
  • 13. The system of claim 1 wherein the controller is configured to obtain data representative of one or more speed restrictions or scheduled maintenance for one or more of the route segments, the controller further configured to generate the alternate route based on the one or more speed restrictions or scheduled maintenance.
  • 14. The system of claim 1 wherein the controller is configured to transmit the alternate route to the off-board system for acceptance or rejection of the alternate route as an authorized route for the vehicle to travel on in the route network.
  • 15. The system of claim 1 wherein the vehicle is a rail vehicle configured to travel over tracks of the route network, and the controller is configured to at least one of store or obtain at least one of track network data or the routing rules that are representative of restrictions of one or more route segments of the tracks in the route network.
  • 16. The system of claim 15 wherein the track network data includes at least one of identifiers assigned to the route segments, identifiers of which route segments are connected to other route segments, a length of one or more of the route segments, a location of one or more switches in the route network relative to route segments, or a recommended direction of travel over one or more of the route segments.
  • 17. The system of claim 15 wherein the track network data comprises at least one of a location of one or more rail vehicle stations in the route network or a location one or more route segments that provide an entrance into or an exit out of the one or more rail vehicle stations.
  • 18. The system of claim 15 wherein the track network data comprises at least one of a physical characteristic of the rail vehicle or cargo on the rail vehicle.
  • 19. The system of claim 15 wherein the route network includes track field equipment that is configured to be activated to control which of the route segments are able to be traversed by the rail vehicle, and the controller is configured to transmit the alternate route to the off-board system for coordination with the field equipment to allow the vehicle to travel along the alternate route.
  • 20. A method comprising: obtaining a designated location for a powered vehicle to travel toward in a route network and routing rules that provide restrictions on travel by the vehicle over one or more route segments in the route network, the designated location being received from an off-board system;generating a predicted route for the vehicle to travel along toward the designated location based on the designated location, the predicted route generated onboard the vehicle;sending the predicted route to a dispatcher disposed off-board of the vehicle for acceptance or rejection by the dispatcher;receiving, from the dispatcher, a first authorized route that is same as the predicted vehicle route when the dispatcher accepts the predicted vehicle route or a second authorized route that is different from the predicted vehicle route when the dispatcher rejects the predicted route;monitoring actual travel of the vehicle in the route network along the first authorized route or the second authorized route; andgenerating an alternate route for the vehicle to travel along toward the designated location when the actual travel of the vehicle deviates from the first authorized route or the second authorized route, the alternate route generated onboard the vehicle and based on the routing rules as the vehicle moves in the route network.
  • 21. The method of claim 20 wherein the routing rules include at least one of locations or positions of switches that couple two or more route segments or a size restriction associated with one or more of the route segments, and the alternate route is generated based on the routing rules.
  • 22. The method of claim 20 wherein the route network includes one or more switches that couple two or more route segments, and further comprising communicating the alternate route to an off-board system that controls positions of the switches to permit the vehicle to travel along the alternate route.
  • 23. The method of claim 20 further comprising receiving a designated route for the vehicle to travel along toward the designated location from the off-board system, wherein generating the alternate route includes changing the designated route to the alternate route when the vehicle diverges or will diverge from one or more route segments on the designated route to an off-route segment, and wherein the alternate route is generated by connecting a current location of the vehicle to one or more route segments that interconnect the current location with the designated location.
  • 24. The method of claim 23 wherein the alternate route includes a first route segment that intersects a second route segment of the designated route, and a remaining portion of the designated route includes one or more of the same route segments as the alternate route, and wherein generating the alternate route includes copying the remaining portion of the designated route from an intersection between the first route segment and the second route segment to generate the alternate route.
  • 25. The method of claim 20 wherein generating the alternate route includes accessing one or more previously generated designated routes associated with the designated location and selecting at least one of the one or more previously generated designated routes as the alternate route.
  • 26. The method of claim 20 further comprising transmitting the alternate route to an off-board system for acceptance or rejection of the alternate route as an authorized route for the vehicle to travel on in the route network.
CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a continuation of U.S. patent application Ser. No. 12/047,427, which was filed on 13 Mar. 2008 (the “'427 application”). The '427 application claims priority to and is a continuation-in-part of U.S. patent application Ser. No. 11/765,443, which was filed on 19 Jun. 2007 (the “'443 application”). The '443 application claims priority to U.S. Provisional Application No. 60/894,039, filed on 9 Mar. 2007 (the “'039 Application”), and to U.S. Provisional Application No. 60/939,852 (the “'852 Application”), filed 24 May 2007. The '443 application also claims priority to and is a continuation-in-part of U.S. patent application Ser. No. 11/669,364, which was filed on 31 Jan. 2007 (the “'364 application”). The '364 application claims priority to U.S. Provisional Application No. 60/849,100, filed 2 Oct. 2006 (the “'100 Application”), and U.S. Provisional Application No. 60/850,885, filed 10 Oct. 2006 (the “'885 Application”). The '364 application also claims priority to and is a continuation-in-part of U.S. patent application Ser. No. 11/385,354, which was filed on 20 Mar. 2006 (the “'354 application”). The entirety of each of these applications (e.g., the '427 application, the '443 application, the '039 Application, the '852 Application, the '364 application, the '100 Application, the '885 Application, and the '354 application) is incorporated by reference.

US Referenced Citations (243)
Number Name Date Kind
2104652 Inman Jan 1938 A
2601634 Rivette Jun 1952 A
2783369 Weber Feb 1957 A
2927711 Naggiar Mar 1960 A
3519805 Thorne-Booth Jul 1970 A
3650216 Harwick et al. Mar 1972 A
3655962 Koch Apr 1972 A
3781139 Lohse Dec 1973 A
3794833 Blazek et al. Feb 1974 A
3865042 DePaola et al. Feb 1975 A
3886870 Pelabon Jun 1975 A
3948314 Creswick et al. Apr 1976 A
4005838 Grundy Feb 1977 A
4041283 Mosier Aug 1977 A
4042810 Mosher Aug 1977 A
4136432 Melley, Jr. Jan 1979 A
4181943 Mercer, Sr. et al. Jan 1980 A
4253399 Spigarelli Mar 1981 A
4279395 Boggio et al. Jul 1981 A
4344364 Nickles et al. Aug 1982 A
4401035 Spigarelli et al. Aug 1983 A
4548164 Ylonen et al. Oct 1985 A
4561057 Haley, Jr. et al. Dec 1985 A
4617627 Yasunobu et al. Oct 1986 A
4644705 Saccomani et al. Feb 1987 A
4663713 Cornell et al. May 1987 A
4711418 Aver, Jr. et al. Dec 1987 A
4735385 Nickles et al. Apr 1988 A
4794548 Lynch et al. Dec 1988 A
4827438 Nickles et al. May 1989 A
4843575 Crane Jun 1989 A
4853883 Nickles et al. Aug 1989 A
5109343 Budway Apr 1992 A
5181541 Bodenheimer Jan 1993 A
5187945 Dixon Feb 1993 A
5197627 Disabato et al. Mar 1993 A
5239472 Long et al. Aug 1993 A
5240416 Bennington Aug 1993 A
5253153 Mathews et al. Oct 1993 A
5316174 Schutz May 1994 A
5363787 Konopasek et al. Nov 1994 A
5388034 Allen et al. Feb 1995 A
5398894 Pascoe Mar 1995 A
5437422 Newman Aug 1995 A
5440489 Newman Aug 1995 A
5460013 Thomsen Oct 1995 A
5487516 Murata et al. Jan 1996 A
5583769 Saitoh Dec 1996 A
5623413 Matheson et al. Apr 1997 A
5642827 Madsen Jul 1997 A
5651330 Jewett Jul 1997 A
5676059 Alt Oct 1997 A
5744707 Kull Apr 1998 A
5755349 Brundle May 1998 A
5758299 Sandborg et al. May 1998 A
5785392 Hart Jul 1998 A
5794172 Matheson et al. Aug 1998 A
5803411 Ackerman et al. Sep 1998 A
5828979 Polivka et al. Oct 1998 A
5950967 Montgomery Sep 1999 A
5957571 Koster et al. Sep 1999 A
5998915 Scholz et al. Dec 1999 A
6092021 Ehlbeck et al. Jul 2000 A
6112142 Shockley et al. Aug 2000 A
6123111 Nathan et al. Sep 2000 A
6125311 Lo Sep 2000 A
6129025 Minakami et al. Oct 2000 A
6135396 Whitfield et al. Oct 2000 A
6144901 Nickles et al. Nov 2000 A
6198993 Higashi et al. Mar 2001 B1
6216957 Turunen, Jr. Apr 2001 B1
6230668 Marsh et al. May 2001 B1
6243694 Bonissone et al. Jun 2001 B1
6263266 Hawthorne Jul 2001 B1
6269034 Shibuya Jul 2001 B1
6270040 Katzer Aug 2001 B1
6308117 Ryland et al. Oct 2001 B1
6325050 Gallagher et al. Dec 2001 B1
6332106 Hawthorne et al. Dec 2001 B1
6363331 Kyrtsos Mar 2002 B1
6380639 Soucy Apr 2002 B1
6404129 Hendricx et al. Jun 2002 B1
6434452 Gray Aug 2002 B1
6459964 Vu et al. Oct 2002 B1
6487488 Peterson, Jr. et al. Nov 2002 B1
6501393 Richards et al. Dec 2002 B1
6505103 Howell et al. Jan 2003 B1
6516727 Kraft Feb 2003 B2
6520124 Bohm, II Feb 2003 B2
6549803 Raghavan et al. Apr 2003 B1
6591263 Becker et al. Jul 2003 B1
6591758 Kumar Jul 2003 B2
6609049 Kane et al. Aug 2003 B1
6612245 Kumar et al. Sep 2003 B2
6612246 Kumar Sep 2003 B2
6615118 Kumar Sep 2003 B2
6647328 Walker Nov 2003 B2
6676089 Katzer Jan 2004 B1
6691957 Hess, Jr. et al. Feb 2004 B2
6694231 Rezk Feb 2004 B1
6698913 Yamamoto Mar 2004 B2
6702235 Katzer Mar 2004 B2
6732023 Sugita et al. May 2004 B2
6763291 Houpt et al. Jul 2004 B1
6789005 Hawthrone Sep 2004 B2
6810312 Jammu et al. Oct 2004 B2
6812888 Drury et al. Nov 2004 B2
6824110 Kane et al. Nov 2004 B2
6845953 Kane et al. Jan 2005 B2
6853888 Kane et al. Feb 2005 B2
6856865 Hawthorne Feb 2005 B2
6863246 Kane et al. Mar 2005 B2
6865454 Kane et al. Mar 2005 B2
6873888 Kumar Mar 2005 B2
6903658 Kane et al. Jun 2005 B2
6910792 Takada et al. Jun 2005 B2
6915191 Kane et al. Jul 2005 B2
6922619 Baig et al. Jul 2005 B2
6948837 Suzuki Sep 2005 B2
6953272 Hayakawa et al. Oct 2005 B2
6957131 Kane et al. Oct 2005 B2
6973947 Penaloza et al. Dec 2005 B2
6978195 Kane et al. Dec 2005 B2
6980894 Gordon et al. Dec 2005 B1
6996461 Kane et al. Feb 2006 B2
7021588 Hess, Jr. et al. Apr 2006 B2
7021589 Hess, Jr. et al. Apr 2006 B2
7024289 Kane et al. Apr 2006 B2
7036774 Kane et al. May 2006 B2
7047130 Watanabe et al. May 2006 B2
7072747 Armbruster et al. Jul 2006 B2
7072757 Adams et al. Jul 2006 B2
7073753 Root et al. Jul 2006 B2
7079926 Kane et al. Jul 2006 B2
7092800 Kane et al. Aug 2006 B2
7092801 Kane et al. Aug 2006 B2
7092894 Crone Aug 2006 B1
7096171 Hawthorne et al. Aug 2006 B2
7127336 Houpt et al. Oct 2006 B2
7131403 Banga et al. Nov 2006 B1
7164975 Bidaud Jan 2007 B2
7222083 Matheson et al. May 2007 B2
7302895 Kumar et al. Dec 2007 B2
7340328 Matheson et al. Mar 2008 B2
7343314 Matheson et al. Mar 2008 B2
7347168 Reckels et al. Mar 2008 B2
7349797 Donnelly et al. Mar 2008 B2
7497201 Hollenbeck Mar 2009 B2
7500436 Kumar et al. Mar 2009 B2
7509193 Kustosch Mar 2009 B2
7522990 Daum et al. Apr 2009 B2
7539624 Matheson et al. May 2009 B2
7558740 Matheson et al. Jul 2009 B2
7618011 Oleski et al. Nov 2009 B2
7667611 Lindsey et al. Feb 2010 B2
7822491 Howlett et al. Oct 2010 B2
20010029411 Hawthorne Oct 2001 A1
20010047241 Khavakh et al. Nov 2001 A1
20020059075 Schick et al. May 2002 A1
20020072833 Gray Jun 2002 A1
20020093201 Soucy Jul 2002 A1
20020096081 Kraft Jul 2002 A1
20020107618 Deguchi et al. Aug 2002 A1
20020174653 Uzkan Nov 2002 A1
20030001050 Katzer Jan 2003 A1
20030034423 Hess, Jr. et al. Feb 2003 A1
20030076221 Akiyama et al. Apr 2003 A1
20030091017 Davenport et al. May 2003 A1
20030104899 Keller Jun 2003 A1
20030105561 Nickles et al. Jun 2003 A1
20030120400 Ahmed Baig et al. Jun 2003 A1
20030183729 Root et al. Oct 2003 A1
20030213875 Hess et al. Nov 2003 A1
20030222981 Kisak et al. Dec 2003 A1
20030229446 Boscamp et al. Dec 2003 A1
20030233959 Kumar Dec 2003 A1
20030236598 Villarreal Antelo et al. Dec 2003 A1
20040010432 Matheson et al. Jan 2004 A1
20040034556 Matheson et al. Feb 2004 A1
20040068359 Neiss et al. Apr 2004 A1
20040093245 Matheson et al. May 2004 A1
20040098142 Warren et al. May 2004 A1
20040104312 Hess, Jr. et al. Jun 2004 A1
20040108814 Tsuda et al. Jun 2004 A1
20040111309 Matheson et al. Jun 2004 A1
20040122569 Bidaud Jun 2004 A1
20040129289 Hafemann Jul 2004 A1
20040133315 Kumar et al. Jul 2004 A1
20040172175 Julich et al. Sep 2004 A1
20040174121 Tsuda et al. Sep 2004 A1
20040245410 Kisak et al. Dec 2004 A1
20050007020 Tsuda et al. Jan 2005 A1
20050055287 Schmidtberg et al. Mar 2005 A1
20050065674 Houpt et al. Mar 2005 A1
20050085961 Kane et al. Apr 2005 A1
20050109882 Armbruster et al. May 2005 A1
20050120904 Kumar et al. Jun 2005 A1
20050121005 Edwards et al. Jun 2005 A1
20050171655 Flynn et al. Aug 2005 A1
20050171657 Kumar Aug 2005 A1
20050188745 Staphanos et al. Sep 2005 A1
20050196737 Mann Sep 2005 A1
20050205719 Hendrickson et al. Sep 2005 A1
20050234757 Matheson et al. Oct 2005 A1
20050251299 Donnelly et al. Nov 2005 A1
20050288832 Smith et al. Dec 2005 A1
20060041341 Kane et al. Feb 2006 A1
20060047379 Schullian et al. Mar 2006 A1
20060060345 Flik et al. Mar 2006 A1
20060085103 Smith et al. Apr 2006 A1
20060085363 Cheng et al. Apr 2006 A1
20060086546 Hu et al. Apr 2006 A1
20060116789 Subramanian et al. Jun 2006 A1
20060116795 Abe et al. Jun 2006 A1
20060122737 Tani et al. Jun 2006 A1
20060155434 Kane et al. Jul 2006 A1
20060162973 Harris et al. Jul 2006 A1
20060212188 Kickbusch et al. Sep 2006 A1
20060212189 Kickbusch et al. Sep 2006 A1
20060277906 Burk et al. Dec 2006 A1
20060282199 Daum et al. Dec 2006 A1
20070061053 Zeitzew Mar 2007 A1
20070108308 Keightley May 2007 A1
20070112475 Koebler et al. May 2007 A1
20070219680 Kumar et al. Sep 2007 A1
20070219681 Kumar et al. Sep 2007 A1
20070219683 Daum et al. Sep 2007 A1
20070233364 Kumar Oct 2007 A1
20070260369 Philp et al. Nov 2007 A1
20070261648 Reckels et al. Nov 2007 A1
20080004721 Huff et al. Jan 2008 A1
20080128563 Kumar et al. Jun 2008 A1
20080147256 Liberatore Jun 2008 A1
20080208393 Schricker Aug 2008 A1
20090044530 Gallagher et al. Feb 2009 A1
20090063045 Figueroa et al. Mar 2009 A1
20090140574 Gorman et al. Jun 2009 A1
20090177345 Severinsky et al. Jul 2009 A1
20090248220 Ecton et al. Oct 2009 A1
20090254239 Daum et al. Oct 2009 A1
20090319092 Piche Dec 2009 A1
20100152998 Schwarzmann Jun 2010 A1
20110035138 Kickbusch et al. Feb 2011 A1
Foreign Referenced Citations (75)
Number Date Country
2 192 151 Aug 1997 CA
642 418 Apr 1984 CH
1 605 862 May 1971 DE
129 761 Feb 1978 DE
208 324 May 1984 DE
255 132 Mar 1988 DE
196 45 426 May 1997 DE
197 26 542 Nov 1998 DE
198 30 353 Feb 2001 DE
199 35 349 Feb 2001 DE
199 35 352 Feb 2001 DE
199 35 353 Feb 2001 DE
100 45 921 Mar 2002 DE
0 114 633 Aug 1984 EP
0 257 662 Mar 1988 EP
0 341 826 Nov 1989 EP
0 594 226 Sep 1990 EP
0 428 113 Nov 1990 EP
467 377 Jan 1992 EP
0 485 978 May 1992 EP
0 539 885 May 1993 EP
0 554 983 Aug 1993 EP
755 840 Jan 1997 EP
0 958 987 Nov 1999 EP
1012019 Jun 2000 EP
1 136 969 Jul 2002 EP
1 293 948 Mar 2003 EP
1 297 982 Apr 2003 EP
1297982 Apr 2003 EP
1 466 803 Oct 2004 EP
1 564 395 Aug 2005 EP
1564395 Aug 2005 EP
1 253 059 Aug 2006 EP
1697196 Sep 2006 EP
1 816 332 Aug 2007 EP
2 129 215 Oct 1972 FR
2 558 806 Jan 1984 FR
2 767 770 Sep 1997 FR
482 625 Dec 1936 GB
1 321 053 Jun 1973 GB
1 321 054 Jun 1973 GB
2 188 464 Sep 1987 GB
60 028153 Feb 1985 JP
03213459 Sep 1991 JP
05077734 Mar 1993 JP
50-32733 Sep 1993 JP
06-108869 Apr 1994 JP
06153327 May 1994 JP
08198102 Aug 1996 JP
09076913 Mar 1997 JP
10-505036 May 1998 JP
2001-065360 Mar 2001 JP
2005002802 Jan 2005 JP
2005-232990 Sep 2005 JP
2005-343294 Dec 2005 JP
2006-320139 Nov 2006 JP
2006-327551 Dec 2006 JP
2008535871 Sep 2008 JP
5061347 Oct 2012 JP
9003622 Apr 1990 WO
WO 9525053 Sep 1995 WO
9606766 Sep 1996 WO
WO 9914093 Mar 1999 WO
WO9914090 Mar 1999 WO
WO 03097424 Nov 2003 WO
WO 2004023517 Mar 2004 WO
WO 2004051699 Jun 2004 WO
WO 2004052755 Jun 2004 WO
WO 2004059446 Jul 2004 WO
WO 2004051700 Jul 2005 WO
WO 2005061300 Jul 2005 WO
2006049252 Nov 2006 WO
WO 2007027130 Mar 2007 WO
WO 2007091270 Aug 2007 WO
2007111768 Oct 2007 WO
Non-Patent Literature Citations (25)
Entry
ISR and WO pertaining to International application No. PCT/US2009/032933 dated Feb. 3, 2009.
Salasoo,Lembit, “Heavy vehicle systems optimization program: FY 2004 Annual Report”.
DOE, “21st Century Locomotive Technology-Quarterly Technical Status Report 6”.
DOE, “21st Century Locomotive Technology, Quarterly Technical Status Report 11”.
King, Robert D., “DOE heavy vehicle systems optimization (peer review): 21st Century Locomotive Technology”.
Razouqi et al. RYNSORD: A Novel, Decentralized Algorithm for Railway Networks with ‘Soft Reservation’, VTC, 1998, pp. 1585-2589, V3, New York, NY.
ISR and WO pertaining to International application No. PCT/US2009/032933 dated Nov. 3, 2009.
Chang et al. “Cycle Detection in Repair-Based Railway Scheduling System”, Robotics and Automation, 1996 pp. 2517-2522, V3, New York, NY.
Grabs, Ulrike, “Modification of Electronic Interlocking EI S in Service”, Signal + Draht, Telzlaff Verlag GmbH, 1995, pp. 254-258, V87(07/08), Darmstadt, DE.
Cheng, Yu, “Hybrid Simulation for Resolving Resource conflicts in Train Traffic Rescheduling”, Computers in Industry, 1998, pp. 233-246, V35(3), Amsterdam, NL.
ISR and WO pertaining to International application No. PCT US2006/032893 dated Aug. 24, 2006.
ISR and WO pertaining to International application No. PCT/US2007/001428 dated Jan. 18, 2007.
ISR and WO pertaining to International application No. PCT/US2007/066697 dated Apr. 16, 2007.
ISR and WO pertaining to International application No. PCT/US2007/076699 dated Aug. 24, 2007.
ISR and WO pertaining to International application No. PCT/US2007/078001 dated Sep. 10, 2007.
ISR and WO pertaining to International application No. PCT/US2007/078016 dated Sep. 10, 2007.
ISR and WO pertaining to International application No. PCT/US2007/078118 dated Sep. 11, 2007.
ISR and WO pertaining to International application No. PCT/US2007/078340 dated Sep. 13, 2007.
ISR and WO pertaining to International application No. PCT/US2008/063193 dated May 9, 2008.
ISR and WO pertaining to International application No. PCT/US2008/083526 dated Nov. 14, 2008.
ISR and WO pertaining to International application No. PCT/US2009/031740 dated Jan. 23, 2009.
ISR and WO pertaining to International application No. PCT/US2009/037293 dated Mar. 16, 2009.
ISR and WO pertaining to International application No. PCT/US2009/045004 dated May 22, 2009.
ISR pertaining to International application No. PCT/US2010/035058 dated May 17, 2010.
ISR pertaining to International application No. PCT/US2010/047251 dated Aug. 31, 2010.
Related Publications (1)
Number Date Country
20130297199 A1 Nov 2013 US
Provisional Applications (4)
Number Date Country
60894039 Mar 2007 US
60939852 May 2007 US
60849100 Oct 2006 US
60850885 Oct 2006 US
Continuations (1)
Number Date Country
Parent 12047427 Mar 2008 US
Child 13344331 US
Continuation in Parts (3)
Number Date Country
Parent 11765443 Jun 2007 US
Child 12047427 US
Parent 11669364 Jan 2007 US
Child 11765443 US
Parent 11385354 Mar 2006 US
Child 11669364 US