All
All

What are you looking for?

All
Projects
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Filters

-
19002100

Join usingOrAnd

Join usingOrAnd

SelectAll/None
  • Show more

SelectAll/None
  • Show more

      • Show less

      • Show less

      • Show less

    • Show more

SelectAll/None
  • Show more

More filters

Results

5 072 results (0,248s)

Result

A Simple Approach to Solving Cooperative Path-Finding as Propositional Satisfiability Works Well

problem (CPF) by translating it to propositional satisfiability (SAT). A novel very simple SAT encoding of CPF is proposed and compared with exist-ing elaborate encodings. The conducted experimental evaluation sho...

JD - Využití počítačů, robotika a její aplikace

  • 2014
  • D
Result

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

other. Anovel SAT encoding of CPF is suggested. The novel encoding uses the concept exist-ing encodings for CPF and also that the SAT based methods dominates over problem (CPF) by translating it to propos...

JD - Využití počítačů, robotika a její aplikace

  • 2014
  • D
Result

Linear Ordering in the SAT Encoding of the All-Different Constraint over Bit-Vectors

A novel eager encoding of the ALLDIFFERENT constraint over bit-vectors is presented in this short paper. It is based on 1-to-1 mapping of the input bit-vectors to a linearly ordered set of auxiliary bit-vectors. Experiments with four SAT...

IN - Informatika

  • 2015
  • O
  • Link
Result

Simple Direct Propositional Encoding of Cooperative Path Finding Simplified Yet More

encod-ings. It has been also shown that the SAT based methods dominates over problem (CPF) by translating it to propositional satisfiability (SAT). The task in CPF elaborate encodings based on binary encodings...

JD - Využití počítačů, robotika a její aplikace

  • 2014
  • D
Result

Lessons Learned from the Effort to Solve Cooperative Path-Finding Optimally: Reductions to Propositional Satisfiability

encodings. It has been also shown that the SAT based methods dominates over A* based problem (CPF) by translating it to propositional satisfiability (SAT). The task in CPF with eachother. Recent findings indicate that a si...

JD - Využití počítačů, robotika a její aplikace

  • 2014
  • O
Result

Application of Propositional Satistiability to Special Cases of Cooperative Path-Planning

A problem of cooperative path-planning is addressed from the perspective of propositional satisfiability in this paper. Two new encodings of the problem as SAT are proposed and evalu-ated....

JD - Využití počítačů, robotika a její aplikace

  • 2012
  • D
Result

On Propositional Encodings of Cooperative Path-finding

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 r...

JD - Využití počítačů, robotika a její aplikace

  • 2012
  • D
Result

Relaxing the Relaxed Exist-Step Parallel Planning Semantics

Solving planning problems via translation to satisfiability (SAT) is one of the most successful approaches to automated planning. We propose a new encoding scheme which encodes a planning problem represented in the SAS+ for...

IN - Informatika

  • 2013
  • D
Result

A SAT-Based Approach to Cooperative Path-Finding Using All-Different Constraints

The approach to solving cooperative-path finding (CPF) as satisfiability (SAT) is revisited. An alternative encoding that exploits multi-valued state variables representing locations where a given agent resides is suggested....

JD - Využití počítačů, robotika a její aplikace

  • 2012
  • O
Result

Efficient SAT Approach to Multi-Agent Path Finding under the Sum of Costs Objective

are able to have a reasonable number of variables in our SAT encoding. We then further improve the encoding by borrowing ideas from ICTS, a search-based solver. Experimental evaluation on several domains showed that there ...

JD - Využití počítačů, robotika a její aplikace

  • 2016
  • D
  • 1 - 10 out of 5 072