@conference {18919,
	title = {Reactive Query Policies: A Formalism for Planning with Volatile External Information},
	year = {2007},
	month = {2007/04/01/5},
	pages = {243 - 250},
	abstract = {To generate plans for collecting data for data mining, an important problem is information volatility during planning: the information needed by the planning system may change or expire during the planning process, as changes occur in the data being collected. In such situations, the planning system faces two challenges: how to generate plans despite these changes, and how to guarantee that a plan returned by the planner will remain valid for some period of time after the planning ends. The focus of our work is to address both of the above challenges. In particular, we provide: 1) A formalism for reactive query policies, a class of strategies for deciding when to reissue queries for information that has changed during the planning process. This class includes all query management strategies that have yet been developed. 2) A new reactive query policy called the presumptive strategy. In our experiments, the presumptive strategy ran exponentially faster than the lazy strategy, the best previously known query management strategy. In the hardest set of problems we tested, the presumptive strategy took 4.7\% as much time and generated 6.9\% as many queries as the lazy strategy},
	keywords = {data collection, data mining, information volatility, planning (artificial intelligence), planning system, presumptive strategy, query management, Query processing, reactive query policies, volatile external information},
	doi = {10.1109/CIDM.2007.368880},
	author = {Au,Tsz-Chiu and Nau, Dana S.}
}
@article {18893,
	title = {Applications of SHOP and SHOP2},
	journal = {Intelligent Systems, IEEE},
	volume = {20},
	year = {2005},
	month = {2005/04//march},
	pages = {34 - 41},
	abstract = {We design the simple hierarchical ordered planner (SHOP) and its successor, SHOP2, with two goals in mind: to investigate research issues in automated planning and to provide some simple, practical planning tools. SHOP and SHOP2 are based on a planning formalism called hierarchical task network planning. SHOP and SHOP2 use a search-control strategy called ordered task decomposition, which breaks tasks into subtasks and generates the plan{\textquoteright}s actions in the same order that the plan executor executes them. So, throughout the planning process, the planner can tell what the state of the world at each step of the plan.},
	keywords = {automated planning, hierarchical task network planning, ordered task decomposition, planning (artificial intelligence), problem solving, search-control strategy, simple hierarchical ordered planner, trees (mathematics), uncertainty handling},
	isbn = {1541-1672},
	doi = {10.1109/MIS.2005.20},
	author = {Nau, Dana S. and Au,T.-C. and Ilghami,O. and Kuter,U. and Wu,D. and Yaman,F. and Munoz-Avila,H. and Murdock,J. W.}
}
@article {15473,
	title = {Hierarchical GUI test case generation using automated planning},
	journal = {Software Engineering, IEEE Transactions on},
	volume = {27},
	year = {2001},
	month = {2001/02//},
	pages = {144 - 155},
	abstract = {The widespread use of GUIs for interacting with software is leading to the construction of more and more complex GUIs. With the growing complexity come challenges in testing the correctness of a GUI and its underlying software. We present a new technique to automatically generate test cases for GUIs that exploits planning, a well-developed and used technique in artificial intelligence. Given a set of operators, an initial state, and a goal state, a planner produces a sequence of the operators that will transform the initial state to the goal state. Our test case generation technique enables efficient application of planning by first creating a hierarchical model of a GUI based on its structure. The GUI model consists of hierarchical planning operators representing the possible events in the GUI. The test designer defines the preconditions and effects of the hierarchical operators, which are input into a plan-generation system. The test designer also creates scenarios that represent typical initial and goal states for a GUI user. The planner then generates plans representing sequences of GUI interactions that a user might employ to reach the goal state from the initial state. We implemented our test case generation system, called Planning Assisted Tester for Graphical User Interface Systems (PATHS) and experimentally evaluated its practicality and effectiveness. We describe a prototype implementation of PATHS and report on the results of controlled experiments to generate test cases for Microsoft{\textquoteright}s WordPad},
	keywords = {Artificial intelligence, automated planning, automatic test case generation, Automatic testing, correctness testing, goal state, Graphical user interfaces, hierarchical GUI test case generation, initial state, Microsoft WordPad, operators, plan-generation system, planning (artificial intelligence), Planning Assisted Tester for Graphical User Interface Systems, program testing, software},
	isbn = {0098-5589},
	doi = {10.1109/32.908959},
	author = {Memon, Atif M. and Pollack,M. E and Soffa,M. L}
}
@conference {15467,
	title = {Using a goal-driven approach to generate test cases for GUIs},
	booktitle = {Software Engineering, 1999. Proceedings of the 1999 International Conference on},
	year = {1999},
	month = {1999/05//},
	pages = {257 - 266},
	abstract = {The widespread use of GUIs for interacting with software is leading to the construction of more and more complex GUIs. With the growing complexity comes challenges in testing the correctness of a GUI and the underlying software. We present a new technique to automatically generate test cases for GUIs that exploits planning, a well developed and used technique in artificial intelligence. Given a set of operators, an initial state and a goal state, a planner produces a sequence of the operators that will change the initial state to the goal state. Our test case generation technique first analyzes a GUI and derives hierarchical planning operators from the actions in the GUI. The test designer determines the preconditions and effects of the hierarchical operators, which are then input into a planning system. With the knowledge of the GUI and the way in which the user will interact with the GUI, the test designer creates sets of initial and goal states. Given these initial and final states of the GUI, a hierarchical planner produces plans, or a set of test cases, that enable the goal state to be reached. Our technique has the additional benefit of putting verification commands into the test cases automatically. We implemented our technique by developing the GUI analyzer and extending a planner. We generated test cases for Microsoft{\textquoteright}s Word-Pad to demonstrate the viability and practicality of the approach.},
	keywords = {Artificial intelligence, automatic test case generation, goal state, goal-driven approach, Graphical user interfaces, GUIs, hierarchical planning operators, initial state, Microsoft Word-Pad, operators, planning (artificial intelligence), program testing, software, verification commands},
	author = {Memon, Atif M. and Pollack,M. E and Soffa,M. L}
}
@article {18849,
	title = {IMACS: a case study in real-world planning},
	journal = {Intelligent Systems and their Applications, IEEE},
	volume = {13},
	year = {1998},
	month = {1998/06//may},
	pages = {49 - 60},
	abstract = {This article discusses the complexities of real-world planning and how to create planning systems to address them. IMACS (Interactive Manufacturability Analysis and Critiquing System), an automated designer{\textquoteright}s aid, evaluates machined parts and suggests design modifications to improve their manufacturability, offering advantages over the planning techniques used in classical planning systems},
	keywords = {automated designer{\textquoteright}s aid, CAD/CAM, case study, computer aided analysis, computer aided production planning, design modifications, IMACS, intelligent design assistants, Interactive Manufacturability Analysis and Critiquing System, interactive systems, machined parts evaluation, machining, manufacturability, planning (artificial intelligence), planning systems},
	isbn = {1094-7167},
	doi = {10.1109/5254.683210},
	author = {Gupta,S.K. and Nau, Dana S. and Regli,W. C.}
}
@conference {11960,
	title = {Purposive and qualitative active vision},
	booktitle = {Proceedings of 10th International Conference on Pattern Recognition, 1990},
	volume = {i},
	year = {1990},
	month = {1990/06/16/21},
	pages = {346-360 vol.1 - 346-360 vol.1},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {The traditional view of the problem of computer vision as a recovery problem is questioned, and the paradigm of purposive-qualitative vision is offered as an alternative. This paradigm considers vision as a general recognition problem (recognition of objects, patterns or situations). To demonstrate the usefulness of the framework, the design of the Medusa of CVL is described. It is noted that this machine can perform complex visual tasks without reconstructing the world. If it is provided with intentions, knowledge of the environment, and planning capabilities, it can perform highly sophisticated navigational tasks. It is explained why the traditional structure from motion problem cannot be solved in some cases and why there is reason to be pessimistic about the optimal performance of a structure from motion module. New directions for future research on this problem in the recovery paradigm, e.g., research on stability or robustness, are suggested},
	keywords = {active vision, Automation, brain models, complex visual tasks, Computer vision, environmental knowledge, highly sophisticated navigational tasks, HUMANS, Image reconstruction, intentions, Kinetic theory, Laboratories, Medusa, Motion analysis, Navigation, planning, planning (artificial intelligence), purposive-qualitative vision, recovery problem, Robust stability, Robustness, SHAPE, stability},
	isbn = {0-8186-2062-5},
	doi = {10.1109/ICPR.1990.118128},
	author = {Aloimonos, J.}
}
