Search Images Maps Play YouTube News Gmail Drive More »
Sign in
Screen reader users: click this link for accessible mode. Accessible mode has the same essential features but works better with your reader.

Patents

  1. Advanced Patent Search
Publication numberUS20060212188 A1
Publication typeApplication
Application numberUS 11/342,857
Publication dateSep 21, 2006
Filing dateJan 31, 2006
Priority dateFeb 27, 2003
Also published asCA2637496A1, CN101484857A, CN101484857B, EP1987322A2, EP1987322A4, US8589057, US20110035138, WO2007089441A2, WO2007089441A3
Publication number11342857, 342857, US 2006/0212188 A1, US 2006/212188 A1, US 20060212188 A1, US 20060212188A1, US 2006212188 A1, US 2006212188A1, US-A1-20060212188, US-A1-2006212188, US2006/0212188A1, US2006/212188A1, US20060212188 A1, US20060212188A1, US2006212188 A1, US2006212188A1
InventorsJoel Kickbusch, Joseph Philp, Mitchell Wills
Original AssigneeJoel Kickbusch, Philp Joseph W, Wills Mitchell S
Export CitationBiBTeX, EndNote, RefMan
External Links: USPTO, USPTO Assignment, Espacenet
Method and apparatus for automatic selection of alternative routing through congested areas using congestion prediction metrics
US 20060212188 A1
Abstract
A scheduling system and method for moving plural objects through a multipath system described as a freight railway scheduling system. The scheduling system utilizes a cost reactive resource scheduler to minimize resource exception while at the same time minimizing the global costs associated with the solution. The achievable movement plan can be used to assist in the control of, or to automatically control, the movement of trains through the system. Alternative routes through congested areas are automatically selected using congestion prediction metrics.
Images(3)
Previous page
Next page
Claims(8)
1. A method of scheduling the movement of trains, each over a selected route, by predicting the occurrence of congestion due to the planned movement of the trains over a selected route comprising:
(a) identifying factors which contribute to congestion;
(b) assigning a metric for each factor;
(c) evaluating the metrics associated with a selected route;
(d) if the evaluate metrics exceed a predetermined threshold, scheduling one or more trains scheduled for the selected route to alternate routes.
2. The method of claim 1 wherein the step of identifying includes evaluating the historical performance of train movement over a selected route.
3. The method of claim 1 wherein the factor is weighted as a function of its relative contribution to congestion.
4. The method of claim 1 wherein the step of evaluating includes cumulating the metrics for a selected route.
5. The method of claim 1 wherein the predetermined threshold is a selected as a function of the historical occurrence of congestion movement of trains over a selected route.
6. A method of scheduling the movement of trains, each over a selected route, by predicting the occurrence of congestion due to the planned movement of the trains over a selected route comprising:
(a) identifying factors which contribute to congestion;
(b) assigning a metric for each factor;
(c) evaluating the metrics associated with a first planned movement of plural trains over a selected route;
(d) evaluating the metric associated with a second planned movement over a selected route;
(e) selecting the planned movement having the lowest metric for scheduling the movement of trains over the selected route.
7. The method of claim 6 wherein the factors include at least one of train density, environmental, temporal, seasonal, and track topology.
8. The method of claim 1 where the step of scheduling one or more trains to an alternate route includes evaluating the metrics for each train planned for the selected route and selecting the train having the highest metrics for rescheduling on an alternate route.
Description
    RELATED APPLICATIONS
  • [0001]
    This application is a continuation in part of application Ser. No. 10/785,059 filed Feb. 25, 2004, claiming the benefit of U.S. Provisional Application 60/449,849 filed on Feb. 27, 2003.
  • [0002]
    This application is also one of the below listed applications being concurrently filed:
  • [0003]
    GEH01 00166 application Ser. No. ______ entitled “Scheduler and Method for Managing Unpredictable Local Trains”;
  • [0004]
    GEH01 00167 application Ser. No. ______ entitled “Method And Apparatus For Optimizing Maintenance Of Right Of Way”;
  • [0005]
    GEH01 00168 application Ser. No. ______ entitled “Method and Apparatus for Coordinating Railway Line-Of-Road and Yard Planners”;
  • [0006]
    GEH01 00169 application Ser. No. ______ entitled “Method and Apparatus for Selectively Disabling Train Location Reports”;
  • [0007]
    GEH01 00170 application Ser. No. ______ entitled “Method And Apparatus For Automatic Selection Of Train Activity Locations”;
  • [0008]
    GEH01 00171 application Ser. No. ______ entitled “Method And Apparatus For Congestion Management”;
  • [0009]
    GEH01 00173 application Ser. No. ______ entitled “Method and Apparatus for Estimating Train Location”.
  • [0010]
    The disclosure of each of the above referenced applications including those concurrently filed herewith is hereby incorporated herein by reference.
  • BACKGROUND OF THE INVENTION
  • [0011]
    The present invention relates to the scheduling of movement of plural units through a complex movement defining system, and in the embodiment disclosed, to the scheduling of the movement of freight trains over a railroad system, and specifically to the alternating routing of trains through congested areas.
  • [0012]
    Systems and methods for scheduling the movement of trains over a rail network have been described in U.S. Pat. Nos. 6,154,735, 5,794,172, and 5,623,413, the disclosure of which is hereby incorporated by reference.
  • [0013]
    As disclosed in the referenced patents and applications, the complete disclosure of which is hereby incorporated herein by reference, railroads consist of three primary components (1) a rail infrastructure, including track, switches, a communications system and a control system; (2) rolling stock, including locomotives and cars; and, (3) personnel (or crew) that operate and maintain the railway. Generally, each of these components are employed by the use of a high level schedule which assigns people, locomotives, and cars to the various sections of track and allows them to move over that track in a manner that avoids collisions and permits the railway system to deliver goods to various destinations.
  • [0014]
    As disclosed in the referenced applications, a precision control system includes the use of an optimizing scheduler that will schedule all aspects of the rail system, taking into account the laws of physics, the policies of the railroad, the work rules of the personnel, the actual contractual terms of the contracts to the various customers and any boundary conditions or constraints which govern the possible solution or schedule such as passenger traffic, hours of operation of some of the facilities, track maintenance, work rules, etc. The combination of boundary conditions together with a figure of merit for each activity will result in a schedule which maximizes some figure of merit such as overall system cost.
  • [0015]
    As disclosed in the referenced applications, and upon determining a schedule, a movement plan may be created using the very fine grain structure necessary to actually control the movement of the train. Such fine grain structure may include assignment of personnel by name as well as the assignment of specific locomotives by number, and may include the determination of the precise time or distance over time for the movement of the trains across the rail network and all the details of train handling, power levels, curves, grades, track topography, wind and weather conditions. This movement plan may be used to guide the manual dispatching of trains and controlling of track forces, or provided to the locomotives so that it can be implemented by the engineer or automatically by switchable actuation on the locomotive.
  • [0016]
    The planning system is hierarchical in nature in which the problem is abstracted to a relatively high level for the initial optimization process, and then the resulting course solution is mapped to a less abstract lower level for further optimization. Statistical processing is used at all levels to minimize the total computational load, making the overall process computationally feasible to implement. An expert system is used as a manager over these processes, and the expert system is also the tool by which various boundary conditions and constraints for the solution set are established. The use of an expert system in this capacity permits the user to supply the rules to be placed in the solution process.
  • [0017]
    Currently, a dispatcher's view of the controlled railroad territory can be considered myopic. Dispatchers view and processes information only within their own control territories and have little or no insight into the operation of adjoining territories, or the railroad network as a whole. Current dispatch systems simply implement controls as a result of the individual dispatcher's decisions on small portions of the railroad network and the dispatchers are expected to resolve conflicts between movements of objects on the track (e.g. trains, maintenance vehicles, survey vehicles, etc.) and the available track resource limitations (e.g. limited number of tracks, tracks out of service, consideration of safety of maintenance crews near active tracks) as they occur, with little advanced insight or warning.
  • [0018]
    Congestion inevitably occurs in the routing of trains and often occurs in the same areas. Congestion is a significant problem. The routing of trains into a congested area tends to exacerbate the congestion and may result in deadlock. Because the delay in the movement of trains is subject to cost constraints including contract penalties, the tendency of dispatchers is to continue to push trains through an area as rapidly as possible, advancing their movement along the line of road whenever possible, and treating the resulting congestion as a track availability problem to be solved through the assignment of track resources to create alternative routes through the congested area. The movement planners used by dispatchers in adjacent territories are often completely independent of each other and uninformed as to the status of the tracks in adjacent territories. As a result, dispatchers in uncongested areas may continue to send trains into a congested area in the adjacent territory.
  • [0019]
    The present invention relates to the anticipation and avoidance of congestion to maximize the throughput of trains in the overall system at the expense of the movement of trains over smaller sections of track.
  • [0020]
    Congestion generally is the after-the-fact result of acts set in motion by dispatchers assisted by train movement planners, i.e., by acts taken long prior to the development of actual congestion. By the time that congestion is actually detected, other trains are enroute through the congested area and in may cases have passed the point in the system where an alternative route may have been selected.
  • [0021]
    Typically, the routing of trains through areas of expected congestion is handled by dispatchers utilizing tribal knowledge, i.e., knowledge gained through the dispatcher's personal experience and the experience of other dispatchers passed to him.
  • [0022]
    It is accordingly an object of the present invention to reduce congestion and avoid deadlock by the management of the entry of trains into a congested area.
  • [0023]
    These and many other objects and advantages of the present invention will be readily apparent to one skilled in the art to which the invention pertains from a perusal of the claims, the appended drawings, and the following detailed description of the preferred embodiments.
  • BRIEF DESCRIPTION OF THE DRAWING
  • [0024]
    FIG. 1 is a simplified pictorial representation of one embodiment of the present invention for use with a rail network divided into control areas.
  • [0025]
    FIG. 2 is a simplified flow diagram for one embodiment of a scheduling method that predicts the occurrence of congestion over a selected route.
  • DETAILED DESCRIPTION
  • [0026]
    As illustrated in FIG. 1, the global rail network 105 can be divided into one or more control areas 100 (100A-100C), each of which has a dispatcher 110 (110A-110C) assigned to manage the movement of trains (102) through his respective control area 100. A centralized movement planner 120 provides a network based movement plan for the global rail network 105 based on input received from the railroad information support center 130. The railroad information support center 130 provides information related to the track resources and other information suitable to plan the use of the resources. Centralized movement planner 120 generates a movement plan for the resources in the track network 105 and provides the plan to the automated dispatcher 140. Movement planner 120 may also received updates on the execution of the movement plan from automated dispatcher 140 and can update the current movement plan. Automated dispatcher 140 provides each of the dispatchers 110 with the movement plan to manage the train resources in their respective control areas 110.
  • [0027]
    As described in the referenced applications, the automated dispatcher 140 can be implemented using computer usable medium having a computer readable code executed by special purpose or general purpose computers. The automated dispatcher 140 communicates with trains 102 on the network of track via a suitable communication link 150, such as a cellular telephone, satellite or wayside signaling.
  • [0028]
    The dispatcher issues and approves the issuance of movement authorities and track restrictions, schedule maintenance of way activities and communicates with train crews, yard managers and other railroad personnel consistent with an optimized operating plan for the railroad. While the dispatcher will rely on the movement planner to solve the complex problem of optimizing movement of trains, the dispatcher will be actively involved in entering the necessary data required to maintain an optimized plan and identify exceptions to the plan.
  • [0029]
    As disclosed in the referenced applications, enhanced planning is facilitated by automatically supplying the movement planner 120 with information from the railroad information support center 130 which associates train consist events (e.g., pickups, crew changes, engine destinations) with planned train activities that occupy track resources for the duration of a dwell time, so that maintenance of the traditional train sheet data (via electronic messaging and user data entry) is automatically reflected in the train trip specifications for use for movement planning.
  • [0030]
    From this information, and with the aid of suitable conventional traffic flow analysis algorithms desirably embedded in the movement planner 120, congestion in a particular geographic area can be identified and the dispatchers in other areas advised of the existence of the congestion and decline to push trains into the congested area. Thus, traffic flow analysis algorithms can detect and may also be used to predict the further occurrence of congestion.
  • [0031]
    The present application also is directed to the identification of areas that are prone to congestion and to take action sufficiently in advance of the predicted congestion to minimize or obviate avoid the congestion all together. In one embodiment, the maintenance of a historical data base of events that have resulted in congestion may be used in anticipating congestion. For example, analysis of a historical database may identify factors which are associated with congestion. Such factors may be temporal, e.g., between 3:00 and 5:00 p.m. or seasonal, e.g., during winter months, in nature. The factors may include environmental conditions, track topography, type of train, identification of crew, or other factors which may affect the likelihood of congestion. Each factor may be assigned a metric as a function of its contribution to the occurrence of congestion. The factors may also be weighted depending on the contribution of the factor. Through statistical analysis, it may be determined for a particular route, that the planned usage of the route by its scheduled trains may cause the cumulative metric for the route to exceed a predetermined threshold indicating the likely occurrence of congestion. The congestion metrics may be used by the movement plan to schedule the trains to alternative routes in order to reduce the metric for a given route to below the predetermined threshold.
  • [0032]
    FIG. 2 illustrates one embodiment of the present application. A method of scheduling the movement of trains may be accomplished by predicting the occurrence of congestion due to the planned movement of the trains over a selected route. Factors are identified 200 which contribute to the congestion. The factors may be identified through the collection and analysis of the historical performance of trains over a selected route. Once the factors are identified, a metric can be assigned to each factor 210 to account for that factors contribution to congestion. The factor may be weighted appropriately with relation to other factors, or may be linked to other factors to account for the relationship that may exist between factors. Each route can then be evaluated to determine the probability of congestion based on the planned movement of trains over the selected route. This can be accomplished by evaluating the metrics for each planned movement of a train over the selected route 220. If the cumulative metrics for a given route exceed some predetermined threshold 230, one or more of the planned movement of the trains can be rescheduled to an alternate route 240.
  • [0033]
    In another embodiment, if the cumulative metrics for a route exceed a predetermined threshold, a further evaluation can be done to determine the contribution of each planned train to the predicted congestion and the train contributing the most can be selected for rescheduling to an alternate route.
  • [0034]
    These methods of scheduling may be implemented using computer usable medium having a computer readable code executed by special purpose or general purpose computers.
  • [0035]
    Other factors that may be considered to predict congestion include train density, type of train, the identity of the particular crew controlling a train, the type of load being carried by the train, physical constraints of the train, network topography including number of crossings, availability of sidings, zone restrictions or curfews. The weighting of the factors can be based upon historical statistics and can vary as a function of other factors. For example, the weight of the train may be a factor that is weighted more heavily in those areas where the track topography factor indicates a steep incline.
  • [0036]
    The combined metric for a route need not exceed a predetermined threshold to take steps to reduce the probability of congestion. The metric for a route can be compared against a metric for the same route with alternate planning to pick the planned movement over the route that results in the lowest congestion metric. Thus, a route metric evaluation can be performed for a number of different planned movements over the route to select the planned movement resulting in the lowest probability of congestion.
  • [0037]
    Departure times may be delayed and/or safe places can be found for trains en route along the line-of-road. Deadlocks may thus be prevented and the alternate routes may remain unblocked for use by the movement planner 120 in clearing the congestion.
  • [0038]
    While the delay of trains in uncongested areas may be costly, this cost may pale in comparison to the savings achieved as a result of the improvement of traffic flow through the system as a whole.
  • [0039]
    While preferred embodiments of the present invention have been described, it is understood that the embodiments described are illustrative only and the scope of the invention is to be defined solely by the appended claims when accorded a full range of equivalence, many variations and modifications naturally occurring to those of skill in the art from a perusal hereof.
Patent Citations
Cited PatentFiling datePublication dateApplicantTitle
US3944986 *Jan 16, 1974Mar 16, 1976Westinghouse Air Brake CompanyVehicle movement control system for railroad terminals
US4361301 *Oct 8, 1980Nov 30, 1982Westinghouse Electric Corp.Vehicle train tracking apparatus and method
US4610206 *Apr 9, 1984Sep 9, 1986General Signal CorporationMicro controlled classification yard
US5332180 *Dec 28, 1992Jul 26, 1994Union Switch & Signal Inc.Traffic control system utilizing on-board vehicle information measurement apparatus
US5823481 *Oct 7, 1996Oct 20, 1998Union Switch & Signal Inc.Method of transferring control of a railway vehicle in a communication based signaling system
US6032905 *Aug 14, 1998Mar 7, 2000Union Switch & Signal, Inc.System for distributed automatic train supervision and control
US6144901 *Sep 11, 1998Nov 7, 2000New York Air Brake CorporationMethod of optimizing train operation and training
US6250590 *Jan 16, 1998Jun 26, 2001Siemens AktiengesellschaftMobile train steering
US6351697 *Dec 3, 1999Feb 26, 2002Modular Mining Systems, Inc.Autonomous-dispatch system linked to mine development plan
US6377877 *Sep 15, 2000Apr 23, 2002Ge Harris Railway Electronics, LlcMethod of determining railyard status using locomotive location
US6393362 *Mar 7, 2000May 21, 2002Modular Mining Systems, Inc.Dynamic safety envelope for autonomous-vehicle collision avoidance system
US6427114 *Jul 30, 1999Jul 30, 2002Dinbis AbMethod and means for traffic route control
US6587764 *Jan 10, 2003Jul 1, 2003New York Air Brake CorporationMethod of optimizing train operation and training
US6611750 *Sep 27, 2001Aug 26, 2003International Business Machines CorporationHierarchical traffic control system
US6637703 *Dec 21, 2001Oct 28, 2003Ge Harris Railway Electronics LlcYard tracking system
US6654682 *Jan 11, 2001Nov 25, 2003Siemens Transportation Systems, Inc.Transit planning system
US6766228 *Feb 25, 2002Jul 20, 2004AlstomSystem for managing the route of a rail vehicle
US6789005 *Nov 22, 2002Sep 7, 2004New York Air Brake CorporationMethod and apparatus of monitoring a railroad hump yard
US6799100 *May 28, 2002Sep 28, 2004Modular Mining Systems, Inc.Permission system for controlling interaction between autonomous vehicles in mining operation
US6853889 *Dec 20, 2001Feb 8, 2005Central Queensland UniversityVehicle dynamics production system and method
US6856865 *Jan 7, 2004Feb 15, 2005New York Air Brake CorporationMethod and apparatus of monitoring a railroad hump yard
US7006796 *Jun 28, 1999Feb 28, 2006Siemens AktiengesellschaftOptimized communication system for radio-assisted traffic services
US7219067 *Sep 8, 2000May 15, 2007Ge Harris Railway Electronics LlcTotal transportation management system
US7386391 *Dec 19, 2003Jun 10, 2008Union Switch & Signal, Inc.Dynamic optimizing traffic planning method and system
US7428452 *May 20, 2003Sep 23, 2008Ausrail Technologies Pty LimitedScheduling method and system for rail networks
US20030105561 *Jan 10, 2003Jun 5, 2003New York Air Brake CorporationMethod of optimizing train operation and training
US20030183729 *Sep 7, 2001Oct 2, 2003Root Kevin B.Integrated train control
US20040034556 *May 16, 2003Feb 19, 2004Matheson William L.Scheduling system and method
US20040093196 *Sep 8, 2003May 13, 2004New York Air Brake CorporationMethod of transferring files and analysis of train operational data
US20040267415 *May 28, 2004Dec 30, 2004AlstomMethod and apparatus for controlling trains, in particular a method and apparatus of the ERTMS type
US20050107890 *Feb 18, 2003May 19, 2005Alstom Ferroviaria S.P.A.Method and device of generating logic control units for railroad station-based vital computer apparatuses
US20050192720 *Feb 27, 2004Sep 1, 2005Christie W. B.Geographic information system and method for monitoring dynamic train positions
US20060074544 *Dec 19, 2003Apr 6, 2006Viorel MorariuDynamic optimizing traffic planning method and system
Referenced by
Citing PatentFiling datePublication dateApplicantTitle
US7826349 *May 30, 2006Nov 2, 2010Intel CorporationConnection management mechanism
US8126601Mar 13, 2008Feb 28, 2012General Electric CompanySystem and method for predicting a vehicle route using a route network database
US8155811Dec 29, 2008Apr 10, 2012General Electric CompanySystem and method for optimizing a path for a marine vessel through a waterway
US8234023Jun 12, 2009Jul 31, 2012General Electric CompanySystem and method for regulating speed, power or position of a powered vehicle
US8249763Apr 2, 2008Aug 21, 2012General Electric CompanyMethod and computer software code for uncoupling power control of a distributed powered system from coupled power settings
US8290645Mar 21, 2008Oct 16, 2012General Electric CompanyMethod and computer software code for determining a mission plan for a powered system when a desired mission parameter appears unobtainable
US8370006 *Dec 7, 2006Feb 5, 2013General Electric CompanyMethod and apparatus for optimizing a train trip using signal information
US8370007Mar 21, 2008Feb 5, 2013General Electric CompanyMethod and computer software code for determining when to permit a speed control system to control a powered system
US8401720Jun 15, 2009Mar 19, 2013General Electric CompanySystem, method, and computer software code for detecting a physical defect along a mission route
US8473127Jan 9, 2007Jun 25, 2013General Electric CompanySystem, method and computer software code for optimizing train operations considering rail car parameters
US8630757 *Jul 31, 2007Jan 14, 2014General Electric CompanySystem and method for optimizing parameters of multiple rail vehicles operating over multiple intersecting railroad networks
US8725326Jan 5, 2012May 13, 2014General Electric CompanySystem and method for predicting a vehicle route using a route network database
US8751073 *Jan 11, 2013Jun 10, 2014General Electric CompanyMethod and apparatus for optimizing a train trip using signal information
US8788135Feb 4, 2009Jul 22, 2014General Electric CompanySystem, method, and computer software code for providing real time optimization of a mission plan for a powered system
US8903573Aug 27, 2012Dec 2, 2014General Electric CompanyMethod and computer software code for determining a mission plan for a powered system when a desired mission parameter appears unobtainable
US8924049Jul 10, 2012Dec 30, 2014General Electric CompanySystem and method for controlling movement of vehicles
US9156477Dec 3, 2013Oct 13, 2015General Electric CompanyControl system and method for remotely isolating powered units in a vehicle system
US9201409Jun 29, 2011Dec 1, 2015General Electric CompanyFuel management system and method
US9233696Oct 4, 2009Jan 12, 2016General Electric CompanyTrip optimizer method, system and computer software code for operating a railroad train to minimize wheel and track wear
US9266542Jan 31, 2007Feb 23, 2016General Electric CompanySystem and method for optimized fuel efficiency and emission output of a diesel powered system
US9527518Apr 2, 2008Dec 27, 2016General Electric CompanySystem, method and computer software code for controlling a powered system and operational information used in a mission by the powered system
US9669851Mar 13, 2015Jun 6, 2017General Electric CompanyRoute examination system and method
US9682716Apr 6, 2015Jun 20, 2017General Electric CompanyRoute examining system and method
US9689681Aug 12, 2014Jun 27, 2017General Electric CompanySystem and method for vehicle operation
US9733625Mar 20, 2006Aug 15, 2017General Electric CompanyTrip optimization system and method for a train
US20070219681 *Dec 7, 2006Sep 20, 2007Ajith Kuttannair KumarMethod and apparatus for optimizing a train trip using signal information
US20080005314 *May 30, 2006Jan 3, 2008Sumeet KaurConnection management mechanism
US20080033605 *Jul 31, 2007Feb 7, 2008Wolfgang DaumSystem and method for optimizing parameters of multiple rail vehicles operating over multiple intersecting railroad networks
US20080082223 *Jun 19, 2007Apr 3, 2008Wolfgang DaumSystem and method for optimized fuel efficiency and emission output of a diesel powered system
US20100168942 *Dec 29, 2008Jul 1, 2010Joseph Forrest NoffsingerSystem And Method For Optimizing A Path For A Marine Vessel Through A Waterway
US20130131898 *Jan 11, 2013May 23, 2013General Electric CompanyMethod and apparatus for optimizing a train trip using signal information
EP2402229A1Jun 22, 2010Jan 4, 2012Universitšt StuttgartMethod and system for simulating, planning and/or controlling operating processes in a track guided transportation system
WO2008073545A2 *Sep 10, 2007Jun 19, 2008General Electric CompanyMethod and apparatus for optimizing a train trip using signal information
WO2008073545A3 *Sep 10, 2007Aug 7, 2008Gen ElectricMethod and apparatus for optimizing a train trip using signal information
Classifications
U.S. Classification701/19, 701/532
International ClassificationG06Q10/00, G01C21/00, G06F17/00, B61L27/00
Cooperative ClassificationG06Q10/06, B61L27/0027, B61L27/0011
European ClassificationB61L27/00B3, G06Q10/06, B61L27/00B
Legal Events
DateCodeEventDescription
May 23, 2006ASAssignment
Owner name: GENERAL ELECTRIC COMPANY, NEW YORK
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:KICKBUSCH, JOEL;PHILP, JOSEPH WESLEY;WILLS, MITCHELL SCOTT;REEL/FRAME:017922/0174;SIGNING DATES FROM 20060501 TO 20060503