This paper presents a simple and efficient approach to the computation of avoidance maneuvers among moving obstacles. The method is discussed for the case of a single maneuvering object avoiding several obstacles moving on known linear trajectories. The original dynamic problem is transformed into several static problems using the relative velocity between the maneuvering object and each obstac...

Contracts often take the form of options: oil fields can be abandoned, planning permission may go unused, and acquired firms can be liquidated. We consider a seller who auctions a dynamic option among N agents. After the auction, the economy evolves and the winning bidder chooses both if and when to execute the option. The revenue-maximising auction consists of an up-front bid and a contingent ...

Generally ordering policies are done by two methods, including fix order quantity (FOQ) and fix order period (FOP). These methods are static and either the quantity of ordering or the procedure of ordering is fixing in throughout time horizon. In real environments, demand is varying in any period and may be considered as uncertainty. When demand is variable in any period, the traditional and st...

this paper aims to discuss the requirements of safe and smooth trajectory planning of transporter mobile robots to perform non-prehensile object manipulation task. in non-prehensile approach, the robot and the object must keep their grasp-less contact during manipulation task. to this end, dynamic grasp concept is employed for a box manipulation task and corresponding conditions are obtained an...

We study a family of stylized assortment planning problems, where arriving customers make purchase decisions among offered products based on maximizing their utility. Given limited display capacity and no a priori information on consumers’ utility, the retailer must select which subset of products to offer. By offering different assortments and observing the resulting purchase behavior, the ret...

plan (isd); isd is initial state description let N = ;; The graph openlist = ;; is = make-initial-state(isd); N := N [ fisg; push(is, openlist); loopif there are no more reachable states in the openlist then we are done break; else let s = choose a reachable state from openlist; openlist := openlist fsg; oneof split-state : choose a proposition p and split s into jval(p)j states; remove s from ...

This paper develops a dynamic model of retirement withdrawal planning that allows retirees and financial planners to improve the probability of retirement portfolio success while simultaneously increasing the average withdrawal rate. The key elements of the model are periodic adjustments of retirement withdrawal rates based on both portfolio performance and remaining life expectancy, and Monte ...

In this paper, we describe a method of extending the sensor planning abilities of the “MVP” Machine Vision Planning system to plan viewpoints for monitoring a preplanned robot task. The dynamic sensor planning system presented here analyzes geometric models of the environment and of the planned motions of the robot, as well as optical models of the vision sensor. Using a combination of swept vo...

Path planning is dynamic when the path is continually recomputed as more information becomes available. A computational framework for dynamic path planning is proposed which has the ability to provide navigational directions during the computation of the plan. Path planning is performed using a potential eld approach. We use a speciic type of potential function a harmonic function-which has no ...

Dynamic Strategic Planning is an effective method for the development of rational policies for the intelligent, effective development of technology or large-scale engineering projects. It is: • Dynamic in that it explicitly recognizes the risk and uncertainties necessarily associated with any forecast about the future performance and acceptance of any technology, and thus the need to build flex...