Automated planning, the problem of how an agent achieves a goal given a repertoire of actions, is one of the foundational and most widely studied problems in the AI literature. The original formulation of the problem makes strong assumptions regarding the agent's knowledge and control over the world, namely that its information is complete and correct, and that the results of its actions are de...

It is hard to find the global optimum of general nonlinear and nonconvex optimization problems in a reasonable time. This article presents method transfer receding horizon control approach, where nonlinear, are considered, into graph-search problems. Specifically, systems with symmetries considered system dynamics finite-state automaton. In contrast traditional approaches search continues until...

This work considers online optimal motion planning of an autonomous agent subject to linear temporal logic (LTL) constraints. The environment is dynamic in the sense containing mobile obstacles and time-varying areas interest (i.e., reward workspace properties) be visited by agent. Since user-specified tasks may not fully realized partially infeasible), this hard soft LTL constraints, where con...

This work presents a time–space network flow model for scheduling recurring bulk rail deliveries from suppliers to customers. The objective is to maximize demand satisfied while minimizing waiting times for loading and unloading the bulk commodity. The model uses a variety of information including customer demand, rail network characteristics, loading and unloading hours, and track and station ...

MRP (Material Requirement Planning) process generates a production plan which guarantees an exact quantity of right materials on needed time but it sometimes causes capacity problems in the shop floor because of its ignorance on capacity constraints. This paper presents a new planning method which involves the capacity planning during the MRP process. This planning method starts from generating...

Using mobile sensors to perform optimal measurement and estimation of a distributed parameter system in a domain of interest is considered in this paper. Given parameters, how to optimally plan the motion trajectories of the mobile sensors has been known in the literature, where the purpose of mobile sensing is to best estimate the parameters. Clearly, there is a “chick-and-egg” problem regardi...

This paper considers a dynamic lot size problem faced by a producer who supplies a single product to multiple customers. Characterized by their backorder costs as well as shipping costs, the customer with a high backorder cost is the one whose need for the product is more critical than the need of a customer with a low backorder cost. We show that the general problem with time-varying, customer...

In this paper we propose a way of increasing the efficiency of some direct Receding Horizon Control (RHC) schemes. The basic idea is to adapt the allocation of computational resources to how the iterative plans are used. By using Gradual Dense-Sparse discretizations (GDS), we make sure that the plans are detailed where they need to be, i.e., in the very near future, and less detailed further ah...