Patent application number | Description | Published |
20100124219 | Method for Routing Packets in Ad-Hoc Networks with Partial Channel State Information - A method routs a packet from a source node, via relay nodes, to a destination node. The nodes are connected by wireless links x. A channel power gain γ is measured for each link x. Resource trade-off curves y=ƒ(x) are constructed for each link x from the channel power gains γ, wherein y represents a set of resources. A hyperbolic upper bound h/x+c is fitted to each resource curve, such that h/x+c≧ƒ(x), wherein h is a scale factor, and c is an offset. A route with an optimal resource allocation is selected according to the hyperbolic upper bounds. Then, the packet is transmitted from the source node to the destination node using the route. | 05-20-2010 |
20100128703 | Method for Routing Packets in Wireless Ad-Hoc Networks with Probabilistic Delay Guarantees - A method determines an optimal route to deliver a packet from a source node via relay nodes to a destination node in a network. A graph of nodes connected by edges represents possible routes in the network. A probability that the packet arrives at the destination before a deadline time is assigned to each edge. A minimal delay route is selected from the possible routes, and an arrival time for delivering the packet using the minimal delay route is determined. The arrival time is comparing to a deadline time, and the probabilities are scaled accordingly until the minimal delay route is an optimal route. | 05-27-2010 |
20100183242 | Method for Editing Images and Videos - A method edits editing an input image to produce an output image by first partitioning pixels of the input image into sets of adjacent pixels. Then, for each set, a trellis of nodes connected by directed links is defined. Each node corresponds to one of the pixels in the set of pixels, and an action and location of the pixel in the output image. Costs are assigned to the nodes and the links. A least cost path through the trellis is determined, and pixels corresponding to the nodes on the least cost path are edited according to the action and location to form the output image. | 07-22-2010 |
20100329542 | Method for Determining a Location From Images Acquired of an Environment with an Omni-Directional Camera - A location and orientation in an environment is determined by first acquiring a real omni-directional image of an unknown skyline in the environment. A set of virtual omni-directional images of known skylines are synthesized from a 3D model of the environment, wherein each virtual omni-directional image is associated with a known location and orientation. The real omni-directional image with each virtual omni-directional images to determine a best matching virtual omni-directional image with the associated known location and orientation. | 12-30-2010 |
20120118672 | Motion Planning for Elevator Cars Moving Independently in One Elevator Shaft - A method for controlling a motion of a first car and a second car in a multi-car elevator system, wherein the first car and the second car move independently in an elevator shaft, determines alternately motion plans for the first the second cars wherein each part of a motion plan for the first car is determined for a planning period of the first car, wherein a beginning of the planning period of the first car is determined by an end of the planning period of the second car, and an end of the planning period of the first car is determined by a home position of the first car on the motion plan, wherein the part of the motion plan is determined based on motion constraints, a set of requests, and the motion plan of the second car determined by the beginning of the planning period of the first car. | 05-17-2012 |
20120118673 | Motion Planning for Elevator Cars Moving Independently in One Elevator Shaft - A motion of a first car and a second car in a multi-car elevator system, wherein the first car and the second car move independently in an elevator shaft, is controlled by generating a command to move the first car according to a first deceleration curve, if a relationship between a position and a velocity of the first car corresponds to a value on the first deceleration curve; and by generating a command to move the second car according to a second deceleration curve, if a relationship between position and a velocity of the second car corresponds to a value on the second deceleration curve, wherein a distance between the first and the second deceleration curve is equals or greater than a minimum distance. | 05-17-2012 |
20120150324 | Method for Solving Control Problems - A method solves a quadratic programming (QP) problem in real-time implementations of model predictive control for automation applications. The method can be implemented for fine-grained parallel solutions. Due to the extreme simplicity of the method, even serial implementations offer considerable speed advantages. The method solves the problem by formulating, over a predetermined time interval, an optimization problem with a quadratic cost function, and linear state and control constraints as a quadratic program for the application. Then, the quadratic program is solved by applying a parallel quadratic programming update law starting from a positive initial estimate to obtain control actions for the application. | 06-14-2012 |
20120206440 | Method for Generating Virtual Images of Scenes Using Trellis Structures - An image for a virtual view of a scene is generated based on a set of texture images and a corresponding set of depth images acquired of the scene. A set of candidate depth values associated with each pixel of a selected image is determined. For each candidate depth value, a cost that estimates a synthesis quality of the virtual image is determined. The candidate depth value with a least cost is selected to produce an optimal depth value for the pixel. Then, the virtual image is synthesized based on the optimal depth value of each pixel and the texture images. | 08-16-2012 |
20120281929 | Method for Performing Image Processing Applications Using Quadratic Programming - A method performs an image processing application by expressing the image processing application as a non-negative quadratic program (NNQP) with a quadratic objective, and nonnegativity constraints. A Karush-Kuhn-Tucker condition of the NNQP is expressed as a fixpoint ratio. Then, the fixpoint ratio is determined iteratively until a solution to the image processing application is reached with a desired precision. | 11-08-2012 |
20140005804 | System and Method for Controlling Machines According to Pattern of Contours | 01-02-2014 |
20140005819 | Method and System for Detouring Around Features Cut From Sheet Materials with a Laser Cutter According to a Pattern | 01-02-2014 |
20140005822 | Method and System for Cutting Features From Sheet Materials With a Laser Cutter According to a Pattern | 01-02-2014 |
20140114463 | Determining Trajectories of Redundant Actuators Jointly Tracking Reference Trajectory - A method determines trajectories of redundant actuators of a machine including a first actuator and a second actuator. The method determines a first trajectory of the first actuator tracking a reference trajectory with an error tolerance, wherein the error tolerance is a function of a constraint of the second actuator, and determines a second trajectory of the second actuator based on a difference between the reference trajectory and the first trajectory. | 04-24-2014 |
20140341463 | Method for Reconstructing 3D Lines from 2D Lines in an Image - A method for reconstructing—three-dimensional (3D) lines in a 3D world coordinate system from two-dimensional (2D) lines in a single image of scene detects and clusters the 2D lines using vanishing points. A constraint graph of vertices and edges is generated, wherein the vertices represent the 2D lines, and the edges represents constraints on the 2D lines, then identifying the 3D lines that satisfy the constraints and reconstructing the 3D lines using the identified constraints. | 11-20-2014 |
20140343695 | MPC Controller Using Parallel Quadratic Programming - A method controls an operation of a machine using a model predictive control (MPC). The method determine, in response to receiving a state of the operation of the machine, a dual solution of a dual parametric problem of a parametric form of the MPC using a parallel quadratic programming (PQP) rescaling iteratively a candidate dual solution of the dual parametric problem. The coefficients of the dual parametric problem include data representing dynamics of the machine and constraints on the operation of the machine. A parameter of the dual parametric problem includes the state of the operation of the machine. The method determines a primal solution of a primal problem of the MPC using the dual solution of the dual parametric problem. | 11-20-2014 |