1 Overview In this lecture, we will cover more examples of linear programming and introduce linear programming duality. We will also present several algorithms for solving linear programs.
To enhance the experience of a home network user, priori-tization of network traffic is important. Previous solutions to this problem assigned priorities in a static manner. Even though there has been some efforts to assign priorities dynamically , these solutions only used interactivity of applications to prioritize traffic. We present Contextual Router,… (More)
—We present a framework for representing scenarios with complex object interactions, in which a robot cannot directly interact with the object it wishes to control, but must instead do so via intermediate objects. For example, a robot learning to drive a car can only indirectly change its pose, by rotating the steering wheel. We formalize such complex… (More)
—This paper presents an equivalence between feasible kinodynamic planning and optimal kinodynamic planning, in that any optimal planning problem can be transformed into a series of feasible planning problems in a state-cost space whose solutions approach the optimum. This transformation gives rise to a meta-algorithm that produces an asymptotically optimal… (More)