in this paper, we shall define and study the concept of  -statistical convergence and  -statistical cauchy inrandom 2-normed space. we also introduce the concept of  -statistical completeness which would provide amore general frame work to study the completeness in random 2-normed space. furthermore, we also prove some new results.

This paper describes ILP-PLAN, a framework for solving AI planning problems represented as integer linear programs. ILP-PLAN extends the planning as satisfiability framework to handle plans with resources, action costs, and complex objective functions. We show that challenging planning problems can be effectively solved using both traditional branchand-bound IP solvers and efficient new integer...

We consider the view planning problem where a range sensor is mounted on a robot mechanism with non-trivial geometry and kinematics. The robot–sensor system is required to explore the environment for obstacles and free space. We present an information theoretical approach in which the sensing action is viewed as reducing ignorance of the planning space, the C-space of the robot. The concept of ...

In this paper, we present a novel motion-orientated path planning algorithm fo r real-time navigation of mobile agents. The algorithm works well in dynamical and un-configured environments, and is able to produce a collision-free, time -optimal motion trajectory in order to find a navigation path. In addition to the motion constraint path planning, our approach can deal with the unknown obstacl...

The majority of research in the field of automated planning focuses on the synthesis of plans for problems that are solvable. We propose an IPC track to focus on the important and understudied area of unplannibility: proving that a planning problem is unsolvable. We will focus on classical planning problems, as methods for determining whether or not unplannability can have wider applications fo...

An important aspect of mission planning for NASA’s operation of the International Space Station is the allocation and management of space for supplies and equipment. The Stowage, Configuration Analysis, and Operations Planning teams collaborate to perform the bulk of that planning. A peer-to-peer automated planning architecture is proposed to support the three teams in a way that maps naturally...

There is increasing awareness that planning and model checking are closely related fields. Abstraction means to perform search in an over-approximation of the original problem instance, with a potentially much smaller state space. This is the most essential method in model checking. One would expect that it can also be made successful in planning. We show, however, that this is likely to not be...

We are interested in the nature of activity { structured behavior of nontrivial duration { in intelligent agents. We believe that the development of activity is a continual process in which simpler activities are composed, via planning, to form more sophisticated ones in a hierarchical fashion. The success or failure of a planner depends on its models of the environment, and its ability to impl...