Phase Closure Algorithm in Fourier Telescopy

2009 ◽  
pp. 191-194
Keyword(s):  
Closure Algorithm

scholarly journals Topological Frontier-Based Exploration and Map-Building Using Semantic Information

Sensors ◽  
2019 ◽  
Vol 19 (20) ◽  
pp. 4595 ◽  
Author(s):  
Clara Gomez ◽  
Alejandra C. Hernandez ◽  
Ramon Barber
Keyword(s):  
Open Space ◽  
Semantic Information ◽  
State Of The Art ◽  
Fundamental Problem ◽  
Cost Utility ◽  
Indoor Environments ◽  
Map Building ◽  
Topological Map ◽  
Unknown Area ◽  
Closure Algorithm

Exploration of unknown environments is a fundamental problem in autonomous robotics that deals with the complexity of autonomously traversing an unknown area while acquiring the most important information of the environment. In this work, a mobile robot exploration algorithm for indoor environments is proposed. It combines frontier-based concepts with behavior-based strategies in order to build a topological representation of the environment. Frontier-based approaches assume that, to gain the most information of an environment, the robot has to move to the regions on the boundary between open space and unexplored space. The novelty of this work is in the semantic frontier classification and frontier selection according to a cost–utility function. In addition, a probabilistic loop closure algorithm is proposed to solve cyclic situations. The system outputs a topological map of the free areas of the environment for further navigation. Finally, simulated and real-world experiments have been carried out, their results and the comparison to other state-of-the-art algorithms show the feasibility of the exploration algorithm proposed and the improvement that it offers with regards to execution time and travelled distance.

scholarly journals Fully Dynamic Transitive Closure in Plane Dags with one Source and one Sink

1994 ◽  
Vol 1 (30) ◽  
Author(s):  
Thore Husfeldt
Keyword(s):  
Transitive Closure ◽  
Upper Bounds ◽  
Directed Acyclic Graphs ◽  
Closure Problem ◽  
Directed Path ◽  
Lower And Upper Bounds ◽  
New Techniques ◽  
Time Dynamic ◽  
Acyclic Graphs ◽  
Closure Algorithm

We give an algorithm for the Dynamic Transitive Closure Problem for planar directed acyclic graphs with one source and one sink. The graph can be updated in logarithmic time under arbitrary edge insertions and deletions that preserve the embedding. Queries of the form `is there a directed path from u to v ?' for arbitrary vertices u and v can be answered in logarithmic time. The size of the data structure and the initialisation time are linear in the number of edges.<br /> <br />The result enlarges the class of graphs for which a logarithmic (or even polylogarithmic) time dynamic transitive closure algorithm exists. Previously, the only algorithms within the stated resource bounds put restrictions on the topology of the graph or on the delete operation. To obtain our result, we use a new characterisation of the transitive closure in plane graphs with one source and one sink and introduce new techniques to exploit this characterisation.<br /> <br />We also give a lower bound of Omega(log n/log log n) on the amortised complexity of the problem in the cell probe model with logarithmic word size. This is the first dynamic directed graph problem with almost matching lower and upper bounds.

scholarly journals Parallelization of the next Closure algorithm for generating the minimum set of implication rules

2016 ◽  
Vol 5 (2) ◽  
Author(s):  
Nilander R. M. de Moraes ◽  
Sergio M. Dias ◽  
Henrique C. Freitas ◽  
Luis E. Zarate
Keyword(s):  
Closure Algorithm

scholarly journals Transitive closure algorithm MEMTC and its performance analysis

2001 ◽  
Vol 110 (1) ◽  
pp. 77-84 ◽  
Author(s):  
Vesa Hirvisalo ◽  
Esko Nuutila ◽  
Eljas Soisalon-Soininen
Keyword(s):  
Performance Analysis ◽  
Transitive Closure ◽  
Closure Algorithm

scholarly journals Recursive decomposition tree of a Moore co-family and closure algorithm

2013 ◽  
Vol 70 (1-2) ◽  
pp. 107-122
Author(s):  
Pierre Colomb ◽  
Alexis Irlande ◽  
Olivier Raynaud ◽  
Yoan Renaud
Keyword(s):  
Decomposition Tree ◽  
Recursive Decomposition ◽  
Closure Algorithm
Sign in / Sign up

Export Citation Format

Share Document