All

What are you looking for?

All
Projects
Results
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

42 402 (0,144s)

Result

Variants of independence detection in SAT-based optimal multi-agent path finding

In multi-agent path finding (MAPF) on graphs, the task is to find paths for distinguishable agents so that each agent reaches its unique goal vertex from the given start while collisions between agents are forbidde...

Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

  • 2017
  • D
  • Link
Result

Integration of Independence Detection into SAT-based Optimal Multi-Agent Path Finding A Novel SAT-based Optimal MAPF Solver

The problem of optimal multi-agent path finding (MAPF) is addressed in this paper. The task is to find optimal paths for mobile agents where each of them need function. Agents must not collide with each other which is a sou...

Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

  • 2017
  • D
  • Link
Result

2D P Colonies

We continue the investigation of P colonies introduced as a class of abstract computing devices composed of independent agents, acting and evolving in a shared environment. We are introducing 2D P colonies with a 2D environment wher...

IN - Informatika

  • 2013
  • D
Result

P colonies in 2D

We continue the investigation of P colonies - a class of abstract computing devices composed of independent agents, acting and evolving in a shared environment. We are introducing 2D P colonies with a 2D environment where the ag...

IN - Informatika

  • 2013
  • C
Result

2D P Colonies

We continue the investigation of P colonies introduced as a class of abstract computing devices composed of independent agents, acting and evolving in a shared environment. We are introducing 2D P colonies with a 2D environment wher...

IN - Informatika

  • 2012
  • Jx
  • Link
Result

Modularity in P colonies with checking rules

P colony is an abstract computing device composed of independent agents, acting and evolving in a shared environment. In this paper we bring a new view to investigation of the behavior of the P colonies. The first part of the paper ...

IN - Informatika

  • 2012
  • Jx
  • Link
Result

The MADLA planner: Multi-agent Planning by Combination of Distributed and Local Heuristic Search

planning and high-level planning for robots. Multi-agent planning aims at solving similar problems in the presence of multiple independent entities (agents). EvenReal world applications often require cooperation of multipl...

Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

  • 2017
  • Jimp
  • Link
Result

Agent-based Production Scheduling for Aircraft Manufacturing Ramp-up

the ramp-up phase. The developed scheduler features a combination of multi-agent-agent systems is used to break down the complexity of the scheduling problem into smaller, independent sub-problems that can be solved in...

JC - Počítačový hardware a software

  • 2015
  • D
  • Link
Result

Notes on restricted P colonies

We continue the investigation of P colonies, a class of abstract computing devices composed of independent agents, acting and evolving in a shared environment. We determine the generative power of P colonies with one resp. two objec...

IN - Informatika

  • 2007
  • D
Result

Domain-independent multi-agent plan repair

Achieving joint objectives in distributed domain-independent planning problems by teams of cooperative agents requires significant coordination and communication. However, in multi-agent settings, the communication complexi...

JC - Počítačový hardware a software

  • 2014
  • Jx
  • Link
  • 1 - 10 out of 42 402