University of Oregon

Connected Signals, Inc.

On Time Systems, Inc.

Green Driver, Inc.

Other

State of Oregon

Matthew L Ginsberg

James M Crawford, Jr

William D Harvey

Johnny C Norris, Ii

Ari K Jonsson

Andrew Parkes

Joseph C Pemberton

Eugene M Luks

Martin C Drohmann

Aran Clauson

Andrew B Baker

Timothy S Stirling

Tristan Smith

David Hofer

Pamela D Kinion

Daniel B Keith

Bryan Smith

Robby Jozef Maria Goetschalckx

Peter Jordan Flier

Stewart L Mones

Heidi E Dixon

A driver safety system estimates a time that a traffic signal transitions (e.g., from red to green) by obtaining location information from a user device in the vehicle at various times and using a physical model of the movement of the vehicle to estimate when the vehicle began to move.

Automatic detection of traffic signal states for driver safety system

A driver safety system includes traffic signals communicating with a municipal controller via a first network and user devices communicating with a third party controller via a second network. Communications from the first network are provided to the second network via a repeater server providing one-way communications to avoid the possibility of hacking devices on the first network.

Network security system with application for driver safety system

A traffic routing display system provides a visual display of a speed or series of speeds suggested to the driver such that the driver may pass through multiple consecutive traffic signal devices without stopping at a red light. In one aspect, the display depicts the expected state of an upcoming traffic light. In another aspect, the display is an icon colored to correspond to the expected state. In another aspect, the time remaining before the state of a traffic light changes is displayed. The effect that an indicator has on driver behavior is used to determine the type of indicator to provide to the driver. Certain indicators may not be displayed by the system depending on the effect they have on the driver.

Traffic routing display system with multiple signal lookahead

A safety system determines a correspondence between a vehicle and an upcoming traffic signal, and predicts a state of the traffic signal when the vehicle is expected to reach the signal's location. Based on proximity to the signal and speed of the vehicle, the system provides a warning if it determines that the vehicle is likely to proceed contrary to the signal (e.g., a driver is likely to run a red light). The warning is issued to the vehicle about to illegally enter the intersection, to other nearby vehicles and pedestrians, and to the traffic signal itself.

Driver safety enhancement using intelligent traffic signals and GPS

A system and method for flight planning determines an optimal route by setting an initial departure weight or range of such weights for an aircraft traveling from a departure airport to a destination airport, defining a network of nodes for potentially legal routes, labeling each node with a graph of fuel needed to reach that node either as a function of flight duration or as a function of flight duration and departure weight, selecting or discarding routes when conditions at a node of that route are favorable or violated, selecting a preferred route, departure weight and duration for the desired payload and minimizing fuel for the desired route and payload.

Flight planning system and method using four-dimensional search

Traffic information readings corresponding to a vehicle are received, the readings including at least a location. The traffic information readings are compared to information already within a map database, and are used to derive additional map information augmenting or correcting that already within the database, the additional map information subsequently being stored in the database. Additional information that is derived includes the presence of stop signs and traffic lights at intersections, the legality of turns at certain times of day, and the connectedness or non-connectedness of road segments.

System and method for automated updating of map information

A system and method for flight planning determines an optimal route by first assuming that the gross payload of a plane is used for fuel, determining legal routes based on to-capacity fueling, determining available payload for possible flight segments by removing unneeded fuel, selecting an optimal route for a desired payload, and minimizing fueling for the selected route.

Flight planning system and method

Increased efficiency and lower cost job scheduling is provided by a system and method that optimizes for cost instead of makespan, and minimizes fluctuations in resource utilization. A schedule is constructed using a workflow scheduling system that includes a load leveler, a cost minimizer, and a manpower planner. The load leveler minimizes makespan, subject to resource limits, and then lowers the resource limits, repeating the process in order to create a flatter schedule. The cost minimizer generates an initial solution, and then incrementally improves it, using the manpower planner to evaluate the different possible solutions. The manpower planner calculates, for a given schedule, the optimal hire/fire decisions to minimize total cost.

System and process for job scheduling to minimize construction costs

Data in a database describe an application domain such as a satisfiability problem. The data are represented in a manner that expresses the structure inherent in the data and one such representation uses group theory and represents the data as one or more 'augmented clauses,' where each clause has a pair (c, G) including a database element c and a group G of group elements g acting on it. A query is encoded in a group theory representation and is executed on the group theory representation of the data to identify database elements and associated group elements satisfying the query. If desired, the satisfying database elements are converted from the group theory representation to the native representation of the data.

Database manipulations using group theory

Subsearch, where a satisfiability algorithm searches through the original theory for ground clauses that satisfy some numeric property, is represented in terms of S(C,P,u,s), the set of ground instances of C that have u literals unvalued by P and s literals satisfied by the assignments in P. This representation allows an intelligent search to be performed to answer subsearch problems posed in terms of S(C,P,u,s). Intelligent Subsearch uses truth value assignments to atoms to eliminate sets of bindings to universally quantified variables within a quantified clausal constraint; the bindings being eliminated because the bindings cannot satisfy a specific statement. Intelligent subsearch backtracks away from poor choices in the search for bindings to variables within the quantified clauses. In typical uses, intelligent subsearch can reduce the time of the checking problem from O(D ) to O(D ) for some &agr;<1.

Satisfiability algorithms and finite quantification

Assignment of attributes to elements subject to constraints is achieved using a system that has a systematic engine and a nonsystematic engine. The systematic engine includes a schedule developer for producing partial proposed assignments, a pruning processor for determining violations of discrepancy limits by a partial proposed assignment, and a bound selector for relaxing discrepancy limits as needed. The non-systematic engine includes a schedule packer for modifying assignments proposed by the systematic engine and an evaluator for comparing the modified assignments with the constraints.

Growing community of inventors

Eugene, OR, United States of America

Matthew L Ginsberg