A limitation of the SAT approach to planning and the more recent Weighted-SAT approach to planning with preferences is the use of logical encodings where every fluent and action must be tagged with a time index. The result is that the complexity of the encodings grows exponentially with the planning horizon, and for metrics other than makespan, the optimality achieved is conditional on the plan...

The objective of this work is to augment the basic abilities of a robot by learning to use new sensorimotor primitives to enable the solution of complex long-horizon problems. Solving long-horizon problems in complex domains requires flexible generative planning that can combine primitive abilities in novel combinations to solve problems as they arise in the world. In order to plan to combine p...

In this study, we consider a tactical problem where a time slot combination for delivery service over a given planning horizon must be selected in each zone of a geographical area. Based on the selected time slot combinations, routes are then constructed for the fleet of delivery vehicles for each period of the planning horizon. The routing plan serves as a blueprint for the following operation...

We examine the dynamic pricing decision of a …rm facing random demand while selling a …xed stock of two di¤erentiated products over an in…nite horizon. Prices in each period depend on the available stock of both products (varieties). In addition to the standard tradeo¤ between a higher revenue and the probability of selling the product, a higher price for one product also a¤ects the probability...

We study the development of a social norm of trust and reciprocity via the contagious strategy as de ned in Kandori (1992) among a group of strangers. The players anonymously and randomly meet each other and play a binary trust game in the in nite horizon. In order to provide the investors with proper incentives to follow the contagious strategy, the su cient condition requires that there exist...

We prove theorems pertaining to periodic arrays of spherical obstacles which show how the macroscopic limit of the mean free path depends on the scaling of the size of the obstacles. We treat separately the cases where the obstacles are totally and partially absorbing, and we also distinguish between two-dimensional arrays, where our results are optimal, and higher dimensional arrays where they...

The main contribution of this work is an online path planning framework for cooperative search and localization using unmanned aerial vehicles. In this work, a team of vehicles is used to cooperatively search for a single stationary target. A vision-based sensing system, that incorporates position and attitude uncertainty, is used to develop probabilistic likelihood functions. By accounting for...

Demand for a seasonal product persists for a fixed period of time. Normally the “finite time horizon inventory control problems” are formulated for this type of demands. In reality, it is difficult to predict the end of a season precisely. It is thus represented as an uncertain variable and known as random planning horizon. In this paper, we present a production-inventory model for deterioratin...