International Conference on Automated Planning and Scheduling最新文献_第3页

Can They Come Together? A Computational Complexity Analysis of Conjunctive Possible Effects of Compound HTN Planning Tasks 他们能走到一起吗?复合HTN规划任务可能影响的计算复杂度分析

International Conference on Automated Planning and Scheduling Pub Date : 2023-07-01 DOI: 10.1609/icaps.v33i1.27209

Conny Olz, P. Bercher

引用次数: 1

Multi Agent Path Finding under Obstacle Uncertainty 障碍物不确定性下的多智能体寻径

International Conference on Automated Planning and Scheduling Pub Date : 2023-07-01 DOI: 10.1609/icaps.v33i1.27219

Bar Shofer, Guy Shani, Roni Stern

{"title":"Multi Agent Path Finding under Obstacle Uncertainty","authors":"Bar Shofer, Guy Shani, Roni Stern","doi":"10.1609/icaps.v33i1.27219","DOIUrl":"https://doi.org/10.1609/icaps.v33i1.27219","url":null,"abstract":"In multi-agent path finding (MAPF), several agents must move from their current positions to their target positions without colliding. \u0000Prior work on MAPF commonly assumed perfect knowledge of the environment. \u0000We consider a MAPF setting where this is not the case, \u0000and the planner does not know a-priori whether some positions are blocked or not. \u0000To sense whether such a position is traversable, an agent must move close to it and adapt its behavior accordingly. \u0000In this work we focus on solving this type of MAPF problem, for cases where \u0000planning is centralized but cannot be done during execution. \u0000In this setting, a solution can be formulated as a plan tree for each agent, branching on the observations. \u0000We propose algorithms for finding such plans trees for two modes of executions: \u0000centralized, where the agents share information concerning observed obstacles during execution, \u0000a decentralized, where such communication is not allowed.\u0000The proposed algorithms are complete and can be configured to optimize solution cost, measured for either the best case or the worst case.\u0000We implemented these algorithms and provide experimental results demonstrating how our approach scales with respect to the number of agents and the number of positions we are uncertain about. \u0000The results show that our algorithms can solve non-trivial problems, but also highlight that this type of MAPF problems is significantly harder than classical MAPF.","PeriodicalId":239898,"journal":{"name":"International Conference on Automated Planning and Scheduling","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125828484","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}

引用次数: 0

Automated Planning to Prioritise Digital Forensics Investigation Cases Containing Indecent Images of Children 自动计划优先处理包含儿童不雅图像的数字取证调查案件

International Conference on Automated Planning and Scheduling Pub Date : 2023-07-01 DOI: 10.1609/icaps.v33i1.27230

Saad Khan, S. Parkinson, Monika Roopak, R. Armitage, Andrew M. Barlow

{"title":"Automated Planning to Prioritise Digital Forensics Investigation Cases Containing Indecent Images of Children","authors":"Saad Khan, S. Parkinson, Monika Roopak, R. Armitage, Andrew M. Barlow","doi":"10.1609/icaps.v33i1.27230","DOIUrl":"https://doi.org/10.1609/icaps.v33i1.27230","url":null,"abstract":"Law enforcement agencies (LEAs) globally are facing high demand to view, process, and analyse digital evidence. Arrests for Indecent Images of Children (IIOC) have risen by a factor of 25 over the previous decade. A case typically requires the use of computing resources for between 2-4 weeks. The lengthy time is due to the sequential ordering of acquiring a forensically sound copy of all data, systematically extracting all images, before finally analysing each to automatically identify instances of known IIOC images (second-generation) or manually identifying new images (first-generation). It is therefore normal practice that an understanding of the image content is only obtained right at the end of the investigative process. A reduction in processing time would have a transformative impact, by enabling timely identification of victims, swift intervention with perpetrators to prevent re-offending, and reducing the traumatic psychological effects of any ongoing investigation for the accused and their families.\u0000\u0000In this paper, a new approach to the digital forensic processes containing suspected IIOC content is presented, whereby in-process metrics are used to prioritise case handling, ensuring cases with a high probability of containing IIOC content are prioritised. The use of automated planning (AP) enables a systematic approach to case priorisation. In this paper, a planning approach is presented where AP is used to generate investigative actions in 60-minute segments, before re-planning to account for discoveries made during the execution of planned actions. A case study is provided consisting of 5 benchmark cases, demonstrating on average a reduction of 36% in processing time and a 26% reduction in time required to discover IIOC content.","PeriodicalId":239898,"journal":{"name":"International Conference on Automated Planning and Scheduling","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123249495","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}

引用次数: 1

Sensitivity Analysis for Dynamic Control of PSTNs with Skewed Distributions 偏态分布pstn动态控制的灵敏度分析

International Conference on Automated Planning and Scheduling Pub Date : 2023-07-01 DOI: 10.1609/icaps.v33i1.27183

R. Chen, Yiran Ma, Siqi Wu, James C. Boerkoel

引用次数: 0

Priority-Based Search for the Virtual Network Embedding Problem 基于优先级的虚拟网络嵌入问题搜索

International Conference on Automated Planning and Scheduling Pub Date : 2023-07-01 DOI: 10.1609/icaps.v33i1.27227

Y. Zheng, Hang Ma, Sven Koenig, Erik Kline, T. K. S. Kumar

引用次数: 1

Adaptation and Communication in Human-Robot Teaming to Handle Discrepancies in Agents' Beliefs about Plans 人-机器人团队中的适应与沟通:处理代理人对计划信念的差异

International Conference on Automated Planning and Scheduling Pub Date : 2023-07-01 DOI: 10.1609/icaps.v33i1.27226

Yuening Zhang, B. Williams

{"title":"Adaptation and Communication in Human-Robot Teaming to Handle Discrepancies in Agents' Beliefs about Plans","authors":"Yuening Zhang, B. Williams","doi":"10.1609/icaps.v33i1.27226","DOIUrl":"https://doi.org/10.1609/icaps.v33i1.27226","url":null,"abstract":"When agents collaborate on a task, it is important that they have some shared mental model of the task routines -- the set of feasible plans towards achieving the goals. However, in reality, situations often arise that such a shared mental model cannot be guaranteed, such as in ad-hoc teams where agents may follow different conventions or when contingent constraints arise that only some agents are aware of. Previous work on human-robot teaming has assumed that the team has a set of shared routines, which breaks down in these situations. In this work, we leverage epistemic logic to enable agents to understand the discrepancy in each other's beliefs about feasible plans and dynamically plan their actions to adapt or communicate to resolve the discrepancy. We propose a formalism that extends conditional doxastic logic to describe knowledge bases in order to explicitly represent agents' nested beliefs on the feasible plans and state of execution. We provide an online execution algorithm based on Monte Carlo Tree Search for the agent to plan its action, including communication actions to explain the feasibility of plans, announce intent, and ask questions. Finally, we evaluate the success rate and scalability of the algorithm and show that our agent is better equipped to work in teams without the guarantee of a shared mental model.","PeriodicalId":239898,"journal":{"name":"International Conference on Automated Planning and Scheduling","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116341195","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}

引用次数: 1

A Planning Approach to Repair Domains with Incomplete Action Effects 具有不完全作用效应的修复域的规划方法

International Conference on Automated Planning and Scheduling Pub Date : 2023-07-01 DOI: 10.1609/icaps.v33i1.27190

Alba Gragera, R. Fuentetaja, Angel Garcia-Olaya, F. Fernández

{"title":"A Planning Approach to Repair Domains with Incomplete Action Effects","authors":"Alba Gragera, R. Fuentetaja, Angel Garcia-Olaya, F. Fernández","doi":"10.1609/icaps.v33i1.27190","DOIUrl":"https://doi.org/10.1609/icaps.v33i1.27190","url":null,"abstract":"Automated planning is a problem solving technique for a wide range of scenarios and goals, which typically involves the creation of domain and problem files in formal languages. However, producing complete model descriptions can be challenging and time-consuming, especially for non-experts. Although many tools have been developed to support file editing, mistakes can still be made, such as incomplete or improper specification of the initial state or the set of actions. These errors often result in unsolvable tasks for planners, making it impossible to generate a plan. Explaining the absence of a solution in such cases is essential to support humans in the development of automated planning tasks. \u0000In this paper, we introduce a novel approach to repair planning models where the effects of some actions are incomplete, without further information from the user side. We propose a compilation of the unsolvable task to a new extended planning task, in which new actions are permitted to insert possible missing effects. The solution is a plan that achieves the goals of the original problem while also alerting users of the modifications made to do so. Experimental results demonstrate that this approach can effectively repair incomplete planning domains.","PeriodicalId":239898,"journal":{"name":"International Conference on Automated Planning and Scheduling","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133046393","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}

引用次数: 0

Efficient Multi-Query Bi-Objective Search via Contraction Hierarchies 基于层次结构的高效多查询双目标搜索

International Conference on Automated Planning and Scheduling Pub Date : 2023-07-01 DOI: 10.1609/icaps.v33i1.27225

Han Zhang, Oren Salzman, Ariel Felner, T. K. S. Kumar, Carlos Hernández Ulloa, Sven Koenig

引用次数: 1

Moving Trains like Pebbles: A Feasibility Study on Tree Yards 像鹅卵石一样移动的火车:树场的可行性研究

International Conference on Automated Planning and Scheduling Pub Date : 2023-07-01 DOI: 10.1609/icaps.v33i1.27228

Issa K. Hanou, M. D. Weerdt, J. Mulderij

{"title":"Moving Trains like Pebbles: A Feasibility Study on Tree Yards","authors":"Issa K. Hanou, M. D. Weerdt, J. Mulderij","doi":"10.1609/icaps.v33i1.27228","DOIUrl":"https://doi.org/10.1609/icaps.v33i1.27228","url":null,"abstract":"The Train Unit Shunting Problem concerns the parking of trains outside their scheduled use on so-called shunting yards. This is an NP-hard problem, and the current algorithm used by the Netherlands Railways cannot detect whether an instance is infeasible. So, infeasible instances can cause needlessly long computation times. Therefore, this paper fills the gap by providing novel approaches to determine the feasibility. For this, the Pebble Motion problem is considered which moves pebbles from their starting node to their goal node in the graph, such that no two pebbles occupy a node at the same time. A variant of the Pebble Motion problem is proposed to model the Train Unit Shunting Problem, where train units are represented by pebbles and the arrival and departure of train unit combinations are also included. This paper specifically looks at dead-end track shunting yards, as they can be abstractly represented by trees, such that trains arrive and depart at the root node. Furthermore, trains cannot be reallocated between arrival and departure in the tree, since reallocation in practice is a very costly process as moves need to be performed by a small set of drivers. The conditions for realizing the departure order of trains are studied, and an efficient method to (partially) determine the feasibility of problem instances is given, which can find the minimal number of tracks required to park the trains. Furthermore, a special case with tracks of length two is shown to be polynomially solvable, while another subset of problem instances with tracks of length six or more is demonstrated to be NP-complete.","PeriodicalId":239898,"journal":{"name":"International Conference on Automated Planning and Scheduling","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115604246","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}

引用次数: 0

Computing Domain Abstractions for Optimal Classical Planning with Counterexample-Guided Abstraction Refinement 基于反例引导的最优经典规划的计算域抽象

International Conference on Automated Planning and Scheduling Pub Date : 2023-07-01 DOI: 10.1609/icaps.v33i1.27198

Raphael Kreft, Clemens Büchner, Silvan Sievers, M. Helmert

{"title":"Computing Domain Abstractions for Optimal Classical Planning with Counterexample-Guided Abstraction Refinement","authors":"Raphael Kreft, Clemens Büchner, Silvan Sievers, M. Helmert","doi":"10.1609/icaps.v33i1.27198","DOIUrl":"https://doi.org/10.1609/icaps.v33i1.27198","url":null,"abstract":"Abstraction heuristics are the state of the art in optimal classical\u0000planning as heuristic search. A popular method for computing\u0000abstractions is the counterexample-guided abstraction refinement\u0000(CEGAR) principle, which has successfully been used for projections,\u0000which are the abstractions underlying pattern databases, and\u0000Cartesian abstractions. While projections are simple and fast to\u0000compute, Cartesian abstractions subsume projections and hence allow\u0000more fine-grained abstractions, however at the expense of efficiency.\u0000Domain abstractions are a third class of abstractions between\u0000projections and Cartesian abstractions in terms of generality. Yet,\u0000to the best of our knowledge, they are only briefly considered in the\u0000planning literature but have not been used for computing heuristics\u0000yet. We aim to close this gap and compute domain abstractions by using\u0000the CEGAR principle. Our empirical results show that domain\u0000abstractions compare favorably against projections and Cartesian\u0000abstractions.","PeriodicalId":239898,"journal":{"name":"International Conference on Automated Planning and Scheduling","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130940504","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}

引用次数: 0