This paper shows how different properties of time and their ethical implications are reflected in the framing debates around planning perceived problem delay delivery infrastructure. We examine way which plans can take form ‘time maps’ that linear projections a series events. lead to assumptions desired futures only be achieved if actions constitute events performed correctly often coupled with...

The large amount of computation necessary for obtaining time optimal solution for moving a manipulator on specified path has made it impossible to introduce an on line time optimal control algorithm. Most of this computational burden is due to calculation of switching points. In this paper a learning algorithm is proposed for finding the switching points. The method, which can be used for both ...

the large amount of computation necessary for obtaining time optimal solution for moving a manipulator on specified path has made it impossible to introduce an on line time optimal control algorithm. most of this computational burden is due to calculation of switching points. in this paper a learning algorithm is proposed for finding the switching points. the method, which can be used for both ...

We consider a representative-agent equilibrium model where the consumer has quasi-geometric discounting and cannot commit to future actions. We restrict attention to a parametric class for preferences and technology and solve for time-consistent competitive equilibria globally and explicitly. We then characterize the welfare properties of competitive equilibria and compare them to that of a pla...

Heuristic search is a technique used pervasively in the fields of artificial intelligence, automated planning and operations research to solve a wide range of problems from planning military deployments to planning tasks for a robot that must clean a messy kitchen. An automated agent can use heuristic search to construct a plan that, when executed, will achieve a desired task. The search algori...

Optimal real-time planning at run time is impossible for complex domains, since planning is intractable. "Reactive" planning has opted for pre-colnpiled plans, but such plans cannot cope with changing goals, and the space of pre-compiled plans is too large to store for a complex domain. Heuristics can prune planning so that it is of more manageable complexity, but there is still no guarantee th...