Abstract is missing.
- Online Planning for a Material Control System for Liquid Crystal Display ManufacturingMinh Binh Do, Kazumichi Okajima, Serdar Uckun, Fumio Hasegawa, Yukihiro Kawano, Koji Tanaka, Lara S. Crawford, Ying Zhang, Aki Ohashi. [doi]
- A Polynomial All Outcome Determinization for Probabilistic PlanningThomas Keller, Patrick Eyerich. [doi]
- Potential Search: A Bounded-Cost Search AlgorithmRoni Tzvi Stern, Rami Puzis, Ariel Felner. [doi]
- Learning Inadmissible Heuristics During SearchJordan Tyler Thayer, Austin J. Dionne, Wheeler Ruml. [doi]
- Scalable Scheduling for Hardware-Accelerated Functional VerificationMichael D. Moffitt, Gernot E. Günther. [doi]
- Limits for Compact Representation of PlansChrister Bäckström, Peter Jonsson. [doi]
- LPRPG-P: Relaxed Plan Heuristics for Planning with PreferencesAmanda Jane Coles, Andrew Coles. [doi]
- Cross-Domain Action-Model Acquisition for Planning via Web SearchHankz Hankui Zhuo, Qiang Yang, Rong Pan, Lei Li. [doi]
- Abstraction Heuristics Extended with Counting AbstractionsBlai Bonet. [doi]
- Visual Programming of Plan Dynamics Using Constraints and LandmarksJulie Porteous, Jonathan Teutenberg, David Pizzi, Marc Cavazza. [doi]
- An Effective Approach to Realizing Planning ProgramsAlfonso Gerevini, Fabio Patrizi, Alessandro Saetti. [doi]
- Searching for Plans with Carefully Designed ProbesNir Lipovetzky, Hector Geffner. [doi]
- Planning for Loosely Coupled Agents Using Partial Order Forward-ChainingJonas Kvarnström. [doi]
- Generalised Domain Model Acquisition from Action TracesStephen Cresswell, Peter Gregory. [doi]
- Planning Problems for Social RobotsGian Diego Tipaldi, Kai Oliver Arras. [doi]
- Heuristic Search for Generalized Stochastic Shortest Path MDPsAndrey Kolobov, Mausam, Daniel S. Weld, Hector Geffner. [doi]
- The Minimal Seed Set ProblemAvitan Gefen, Ronen I. Brafman. [doi]
- Scaling Up Multiagent Planning: A Best-Response ApproachAnders Jonsson, Michael Rovatsos. [doi]
- Exploiting the Computational Power of the Graphics Card: Optimal State Space Planning on the GPUDamian Sulewski, Stefan Edelkamp, Peter Kissmann. [doi]
- Automatic Construction of Efficient Multiple Battery Usage PoliciesMaria Fox, Derek Long, Daniele Magazzeni. [doi]
- When Optimal Is Just Not Good Enough: Learning Fast Informative Action Cost PartitioningsErez Karpas, Michael Katz, Shaul Markovitch. [doi]
- Planning to Perceive: Exploiting Mobility for Robust Object DetectionJavier Vélez, Garrett Hemann, Albert S. Huang, Ingmar Posner, Nicholas Roy. [doi]
- Automatic Polytime Reductions of NP Problems into a Fragment of STRIPSAldo Porco, Alejandro Machado, Blai Bonet. [doi]
- Trade-Offs in Sampling-Based Adversarial PlanningRaghuram Ramanujan, Bart Selman. [doi]
- Fast Subgoaling for Pathfinding via Real-Time SearchCarlos Hernández, Jorge A. Baier. [doi]
- The Multi-Round Balanced Traveling Tournament ProblemRichard Hoshino, Ken-ichi Kawarabayashi. [doi]
- Planning and Acting in Incomplete DomainsChristopher Weber, Daniel Bryce. [doi]
- Heuristics for Planning with SAT and Expressive Action DefinitionsJussi Rintanen. [doi]
- Scheduling an Aircraft Repair ShopMaliheh Aramon Bajestani, J. Christopher Beck. [doi]
- Contingent Planning as AND/OR Forward Search with Disjunctive RepresentationSon Thanh To, Tran Cao Son, Enrico Pontelli. [doi]
- Partial-Order Support-Link SchedulingDebdeep Banerjee, Patrik Haslum. [doi]
- Distributed Control of Situated Assistance in Large Domains with Many TasksJesse Hoey, Marek Grzes. [doi]
- Sample-Based Planning for Continuous Action Markov Decision ProcessesChristopher R. Mansley, Ari Weinstein, Michael L. Littman. [doi]
- Closing the Gap: Improved Bounds on Optimal POMDP SolutionsPascal Poupart, Kee-Eung Kim, DongHo Kim. [doi]
- Computing All-Pairs Shortest Paths by Leveraging Low TreewidthLéon Planken, Mathijs de Weerdt, Roman van der Krogt. [doi]
- Where Ignoring Delete Lists Works, Part II: Causal GraphsJoerg Hoffmann. [doi]
- Planning Multi-Modal Transportation ProblemsJosé E. Flórez, Álvaro Torralba Arias de Reyna, Javier García, Carlos Linares López, Angel García Olaya, Daniel Borrajo. [doi]
- Markov Decision Processes with Ordinal Rewards: Reference Point-Based PreferencesPaul Weng. [doi]
- Effective Heuristics and Belief Tracking for Planning with Incomplete InformationAlexandre Albore, Miquel Ramírez, Hector Geffner. [doi]
- Theoretical Aspects of Scheduling Coupled-Tasks in the Presence of Compatibility GraphGilles Simonin, Rodolphe Giroudeau, Jean-Claude König, Benoît Darties. [doi]
- Efficient Policy Construction for MDPs Represented in Probabilistic PDDLBoris Lesner, Bruno Zanuttini. [doi]
- Dynamic State-Space Partitioning in External-Memory Graph SearchRong Zhou, Eric A. Hansen. [doi]
- Cost-Sensitive Concurrent Planning Under Duration Uncertainty for Service-Level AgreementsAndrew Coles, Amanda Jane Coles, Allan Clark, Stephen Gilmore. [doi]
- A Complete Algorithm for Generating LandmarksBlai Bonet, Julio Castillo. [doi]
- Ensemble Monte-Carlo Planning: An Empirical StudyAlan Fern, Paul Lewis. [doi]
- Directed Search for Generalized Plans Using Classical PlannersSiddharth Srivastava, Neil Immerman, Shlomo Zilberstein, Tianjiao Zhang. [doi]
- A Path Planning Algorithm for an AUV Guided with Homotopy ClassesEmili Hernández, Marc Carreras, Pere Ridao. [doi]