Learn More
Graph databases make use of logics that combine traditional first-order features with navigation on paths, in the same way logics for model checking do. However, modern applications of graph databases impose a new requirement on the expressiveness of the logics: they need comparing labels of paths based on word relations (such as prefix, subword, or(More)
Searching for optimal paths over grids has been widely discussed using search algorithms such as A*. It is an efficient but restricted to artificial heading changes method. Lately, some algorithms have tried to obtain better paths, such as A* Post Smoothed or Theta*. These two variants of A* get an any-angle path avoiding its main limitation but at the(More)
Graph databases in many applications—semantic web, transport or biological networks among others—are not only large, but also frequently modified. Evaluating graph queries in this dynamic context is a challenging task, as those queries often combine first-order and navigational features. Motivated by recent results on maintaining dynamic reachability, we(More)
There is a need to develop open sensors and middleware components that allow transparent integration and plug-and-play interoperability of Medical Devices (MDs) and Computer Engines (CEs). The use of standards seems to be the internationally adopted way to solve these problems and allow implementing ubiquitous solutions, including wearable devices, focused(More)
Thanks to the advances in Artificial Intelligence (AI), and in particular in automated planning & scheduling and execution, goal-oriented controllers have being developed to test degrees of autonomy for robotics systems in challenging scenarios. Despite these efforts, there is a lack of methodology for approaching the design of deliberative systems or(More)
Run-time analysis is a type of empirical tool that studies the time consumed by running an algorithm. This type of analysis has been successfully used in some Artificial Intelligence (AI) fields, in paticular in Metaheuristics. This paper is an attempt to bring this tool to the path-planning community. To this end the paper reports a run-time analysis of(More)