Proceedings of the International Conference on Automated Planning and Scheduling最新文献

Action Elimination and Plan Neighborhood Graph Search: Two Algorithms for Plan Improvement 行动消除和计划邻域图搜索:两种计划改进算法

Proceedings of the International Conference on Automated Planning and Scheduling Pub Date : 2021-05-25 DOI: 10.1609/icaps.v20i1.13402

Hootan Nakhost, Martin Müller

引用次数: 0

From Automated Veriﬁcation to Automated Design 从自动化验证到自动化设计

Proceedings of the International Conference on Automated Planning and Scheduling Pub Date : 2021-05-25 DOI: 10.1609/icaps.v20i1.13428

M. Vardi

引用次数: 0

Plan, Repair, Execute, Explain - How Planning Helps to Assemble your Home Theater 计划，修理，执行，解释-计划如何帮助组装你的家庭影院

Proceedings of the International Conference on Automated Planning and Scheduling Pub Date : 2014-05-11 DOI: 10.1609/icaps.v24i1.13664

P. Bercher, Susanne Biundo-Stephan, T. Geier, Thilo Hoernle, F. Nothdurft, Felix Richter, B. Schattenberg

引用次数: 76

Planning the Behaviour of Low-Cost Quadcopters for Surveillance Missions 为监视任务规划低成本四轴飞行器的行为

Proceedings of the International Conference on Automated Planning and Scheduling Pub Date : 2014-05-11 DOI: 10.1609/icaps.v24i1.13670

S. Bernardini, M. Fox, D. Long

引用次数: 45

LP-Based Heuristics for Cost-Optimal Planning 基于lp的成本最优规划启发式算法

Proceedings of the International Conference on Automated Planning and Scheduling Pub Date : 2014-05-11 DOI: 10.1609/icaps.v24i1.13621

F. Pommerening, G. Röger, M. Helmert, Blai Bonet

引用次数: 76

Satellite Data Download Management with Uncertainty about the Generated Volumes 生成卷不确定的卫星数据下载管理

Proceedings of the International Conference on Automated Planning and Scheduling Pub Date : 2014-05-11 DOI: 10.1609/icaps.v24i1.13661

C. Pralet, G. Verfaillie, A. Maillard, E. Hébrard, Nicolas Jozefowiez, Marie-José Huguet, T. Desmousceaux, Pierre Blanc-Paques, J. Jaubert

{"title":"Satellite Data Download Management with Uncertainty about the Generated Volumes","authors":"C. Pralet, G. Verfaillie, A. Maillard, E. Hébrard, Nicolas Jozefowiez, Marie-José Huguet, T. Desmousceaux, Pierre Blanc-Paques, J. Jaubert","doi":"10.1609/icaps.v24i1.13661","DOIUrl":"https://doi.org/10.1609/icaps.v24i1.13661","url":null,"abstract":"\u0000 \u0000 Earth observation satellites are space sensors which acquire data, compress and record it on board, and then download it to the ground. Because of the use of more and more sophisticated compression algorithms, the amount of data resulting from an acquisition is more and more unpredictable. In such conditions, planning satellite data download activities offline on the ground is more and more problematic. In this paper, we report the results of a work aiming at evaluating the positive impact of planning downloads onboard when the amount of data produced by each acquisition is known.The data download problem to be solved on board is an assignment and scheduling problem with unsharable resources, precedence constraints, time-dependent minimum durations, and a complex optimization criterion. The generic InCELL library is used to model constraints and criterion, to check non temporal constraints, to propagate temporal constraints, and to evaluate the criterion. On top of this library, greedy and local search algorithms have been designed to produce download plans with limited time and computing resources available on board. \u0000 \u0000","PeriodicalId":300570,"journal":{"name":"Proceedings of the International Conference on Automated Planning and Scheduling","volume":"261 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122286979","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 15

Chance-Constrained Consistency for Probabilistic Temporal Plan Networks 概率时间计划网络的机会约束一致性

Proceedings of the International Conference on Automated Planning and Scheduling Pub Date : 2014-05-11 DOI: 10.1609/icaps.v24i1.13651

P. Santana, B. Williams

{"title":"Chance-Constrained Consistency for Probabilistic Temporal Plan Networks","authors":"P. Santana, B. Williams","doi":"10.1609/icaps.v24i1.13651","DOIUrl":"https://doi.org/10.1609/icaps.v24i1.13651","url":null,"abstract":"\u0000 \u0000 Unmanned deep-sea and planetary vehicles operate in highly uncertain environments. Autonomous agents often are not adopted in these domains due to the risk of mission failure, and loss of vehicles. Prior work on contingent plan execution addresses this issue by placing bounds on uncertain variables and by providing consistency guarantees for a `worst-case' analysis, which tends to be too conservative for real-world applications. In this work, we unify features from trajectory optimization through risk-sensitive execution methods and high-level, contingent plan execution in order to extend existing guarantees of consistency for conditional plans to a chance-constrained setting. The result is a set of efficient algorithms for computing plan execution policies with explicit bounds on the risk of failure. To accomplish this, we introduce Probabilistic Temporal Plan Network (pTPN), which improve previous formulations, by incorporating probabilistic uncertainty and chance-constraints into the plan representation. We then introduce a novel method to the chance-constrained strong consistency problem, by leveraging a conflict-directed approach that searches for an execution policy that maximizes reward while meeting the risk constraint. Experimental results indicate that our approach for computing strongly consistent policies has an average scalability gain of about one order of magnitude, when compared to current methods based on chronological search.\u0000 \u0000","PeriodicalId":300570,"journal":{"name":"Proceedings of the International Conference on Automated Planning and Scheduling","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114197130","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 23

A Heuristic Approach to Planning with Incomplete STRIPS Action Models 不完全条形动作模型的启发式规划方法

Proceedings of the International Conference on Automated Planning and Scheduling Pub Date : 2014-05-11 DOI: 10.1609/icaps.v24i1.13635

T. Nguyen, S. Kambhampati

{"title":"A Heuristic Approach to Planning with Incomplete STRIPS Action Models","authors":"T. Nguyen, S. Kambhampati","doi":"10.1609/icaps.v24i1.13635","DOIUrl":"https://doi.org/10.1609/icaps.v24i1.13635","url":null,"abstract":"\u0000 \u0000 Most current planners assume complete domain models and focus on generating correct plans. Unfortunately, domain modeling is a laborious and error-prone task, thus real world agents have to plan with incomplete domain models. While domain experts cannot guarantee completeness, often they are able to circumscribe the incompleteness of the model by providing annotations as to which parts of the domain model may be incomplete. In this paper, we study planning problems with incomplete STRIPS domain models where the annotations specify possible preconditions and effects of actions. We show that the problem of assessing the quality of a plan, or its plan robustness, is #P-complete, establishing its equivalence with the weighted model counting problems. We introduce two approximations, lower and upper bound, for plan robustness, and then utilize them to derive heuristics for synthesizing robust plans. Our planning system, PISA, incorporating stochastic local search with these novel techniques outperforms a state-of-the-art planner handling incomplete domains in most of the tested domains, both in terms of plan quality and planning time.\u0000 \u0000","PeriodicalId":300570,"journal":{"name":"Proceedings of the International Conference on Automated Planning and Scheduling","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122428291","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 19

Analyzing the Impact of Partial States on Duplicate Detection and Collision of Frontiers 分析部分状态对边界重复检测和碰撞的影响

Proceedings of the International Conference on Automated Planning and Scheduling Pub Date : 2014-05-11 DOI: 10.1609/icaps.v24i1.13677

Vidal Alcázar, S. Fernández, D. Borrajo

引用次数: 4

Non-Deterministic Planning With Conditional Effects 具有条件效应的非确定性规划

Proceedings of the International Conference on Automated Planning and Scheduling Pub Date : 2014-05-11 DOI: 10.1609/icaps.v24i1.13682

Christian Muise, Sheila A. McIlraith, Vaishak Belle

引用次数: 28