Planning the next release in software release planning addresses the problem of assigning features to the next release such that technical, resource, risk, and budget constraints ...
Anas Jadallah, Matthias Galster, Mahmood Moussavi,...
For vehicles navigating initially unknown cluttered environments, current state-of-the-art planning algorithms are able to plan and re-plan dynamically-feasible paths efficiently a...
We consider the problem of planning in a stochastic and discounted environment with a limited numerical budget. More precisely, we investigate strategies exploring the set of poss...
—To efficiently solve challenging motion-planning problems with dynamics, this paper proposes treating motion planning not just as a search problem in a continuous space but as ...
The task of IMRT planning, particularly in head-and-neck cancer, is a difficult one, often requiring days of work from a trained dosimetrist. One of the main challenges is the pres...
Patricio D. Simari, Binbin Wu, Robert Jacques, Ale...
Context-aware routing is the problem of finding the shortest route from a start location to a destination location while taking into account the planned movements of other agents...
Adriaan ter Mors, Cees Witteveen, Jonne Zutt, Fern...
Domain-specific features are important in representing problem structure throughout machine learning and decision-theoretic planning. In planning, once state features are provide...
Automated Planning is a very active area of research within Artificial Intelligence. Broadly this discipline deals with the methods by which an agent can independently determine t...
Abstract— Computing a motion that enables a mobile manipulator to open a door is challenging because it requires tight coordination between the motions of the arm and the base. H...
— This paper presents a strategy for planning robot motions in dynamic, cluttered, and uncertain environments. Successful and efficient operation in such environments requires r...