NDLI: On Propositional Encodings of Cooperative Path-Finding

Content Provider	IEEE Xplore Digital Library
Author	Surynek, P.
Copyright Year	2012
Description	Author affiliation: Charles Univ. in Prague, Prague, Czech Republic (Surynek, P.)
Abstract	The approach to solving cooperative-path finding (CPF) as propositional satisfiability (SAT) is revisited in this paper. An alternative encoding that exploits multi-valued state variables representing locations where a given agent resides is suggested. This encoding employs the ALL-DIFFERENT constraint to model the requirement that agents must not collide with each other. The use of suggested state variables also allowed us to incorporate certain heuristic reasoning to reduce the size of the propositional encoding of the problem. We show that our new domain-dependent encoding enables finding of optimal or near optimal solutions to CPFs in certain hard set-ups where A-based techniques such as WHCA fail to do so. Our finding is also that the ALL-DIFFERENT encoding can be solved faster than the existent encoding.
Starting Page	524
Ending Page	531
File Size	426266
Page Count	8
File Format	PDF
ISBN	9781479902279
ISSN	10823409
DOI	10.1109/ICTAI.2012.77
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2012-11-07
Publisher Place	Greece
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Encoding Optimization Planning Educational institutions Cognition Contracts Standards all-different constraint cooperative path-finding propositional satisfia-bility (SAT)
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Compact Representations of Cooperative Path-Finding as SAT Based on Matchings in Bipartite Graphs

Application of propositional satisfiability to special cases of cooperative path-planning

Temporal logic encodings for sat-based bounded model checking (2005).

Mutex reasoning in cooperative path finding modeled as propositional satisfiability

Frugal Propositional Encodings for Planning

Y.: Constraint propagation in propositional planning

On the utility of Plan-space (Causal) Encodings (1999)

Proceedings of the twentieth international conference on automated planning and scheduling (icaps 2010) constraint propagation in propositional planning.

Path Planning Based on Double-Layer Genetic Algorithm

On Propositional Encodings of Cooperative Path-Finding

Similar Documents

Compact Representations of Cooperative Path-Finding as SAT Based on Matchings in Bipartite Graphs

Application of propositional satisfiability to special cases of cooperative path-planning

Temporal logic encodings for sat-based bounded model checking (2005).

Mutex reasoning in cooperative path finding modeled as propositional satisfiability

Frugal Propositional Encodings for Planning

Y.: Constraint propagation in propositional planning

On the utility of Plan-space (Causal) Encodings (1999)

Proceedings of the twentieth international conference on automated planning and scheduling (icaps 2010) constraint propagation in propositional planning.

Path Planning Based on Double-Layer Genetic Algorithm

On Propositional Encodings of Cooperative Path-Finding