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”
EN
ČeštinaEnglish

Filters

8 593 (0,103s) •

Result

Rapidly-Exploring Random Trees: 3D Planning

Path planning, trajectory planning and path optimizing is problematic issue) and its variations, which are good solutions applied on path and trajectory planning area tofind the path from one position to another on...

IN - Informatika

  • 2012
    • •
  • D
    • •
  • Link
Result

Mobile Robot Path Planning by Means of Case-Based Reasoning

The aim of the path planning is searching for a path from a start to a goal) of the path. We have investigated possibilities to use case-based reasoning (CBR) for improvement of existing path planning methods. We h...

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

  • 2005
    • •
  • C
Result

Bounding the distance among longest paths in a connected graph

It is easy to see that in a connected graph any 2 longest paths have a vertex longest paths have no common vertex, but every k - 1 longest paths have a common vertex. It is not known whether every 3 longest paths i...

Pure mathematics

  • 2018
    • •
  • Jimp
    • •
  • Link
Result

Dissection of the path-simplex in Rn into n path-subsimplices

and path-simplices. Dissection of path-simplices is considered, which leads to a new result: generalization of Coxeter´s trisection of a path-tetrahedron into three path leads to a self-similar path-simpl...

BA - Obecná matematika

  • 2007
    • •
  • Jx
Result

All Paths

All paths...

AL - Umění, architektura, kulturní dědictví

  • 2002
    • •
  • D
Result

Towards Ontology Exploration based on Path Structure Richness

Main topics of the document: path diversity; path richness; ontology exploration; OWL; semantic web...

IN - Informatika

  • 2015
    • •
  • D
    • •
  • Link
Result

The master plan of bicycle path in Prague 10

The project defines a network of cycle paths for Prague 10, including technical and transport solutions.

AP - Městské, oblastní a dopravní plánování

  • 2012
    • •
  • Nmap
Result

Noncrossing Hamiltonian paths in geometric graphs

Hamiltonian path is a path visiting all vertices of a graph. The path is non-crossing if it does not cross itself. We study what is the minimum number edges of complete geometic graph you have to remove to guarantee there i...

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

  • 2007
    • •
  • Jx
Result

Mobile Robot Path Planning by Means of Case-Based Reasoning

In this paper, we deal with mobile robot path planning in a partially known and hazardous areas are defined. The aim of the path planning is searching for a path froma and difficulty (risk) of the path. We propose ...

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

  • 2005
    • •
  • Jx
Result

Old Paths

Old paths...

AL - Umění, architektura, kulturní dědictví

  • 2001
    • •
  • M
  • 1 - 10 out of 8 593