untraversable


Also found in: Dictionary.
Graphic Thesaurus  🔍
Display ON
Animation ON
Legend
Synonym
Antonym
Related
  • adj

Words related to untraversable

incapable of being traversed

References in periodicals archive ?
In both cases secrecy refers to the untraversable intervals of separation (discretion) between the existent and the temporalities of his life and death.
They are either traversable (with cost one) or untraversable.
The shortest path changed because two cells on the original shortest path became untraversable.
Now assume that cell D1 becomes untraversable, as shown in the right gridworld of figure 2, and thus, the costs of all edges into the cell become infinity, and it is claimed that the values in the cells remain equal to the correct start distances.
When it observes obstacles as it follows this path, it enters them into its map and then repeats the procedure, until it eventually reaches the goal coordinates, or all paths to them are untraversable.
To implement this navigation strategy, the robot needs to replan shortest paths whenever it detects that its current path is untraversable.
As a gauge of how far the gulf between the sides has widened to an untraversable chasm, even the Spurs fans who arrived dreaming of putting the bubbly on ice knew events at Elland Road had been far more important for their team.
Indeed, he recalls their telling him that Hitler's army applied currents to the tracks of tanks in its Eastern campaign so that the vehicles could maneuver through the normally untraversable muck that characterizes Russia's spring thaw.
Other writers brave the yawning, untraversable space that can stretch between a mother and a daughter.
With the advent of wheeled vehicles, Stone Age footpaths became rutted, swampy areas became impassable, and steep grades became untraversable.
These untraversable barriers include language and social/cultural differences.
The robot can move one location (cell) to the north, east, south, or west, unless this location is untraversable.
Onboard sensors tell the robot in every location which of the four adjacent locations (north, east, south, west) are untraversable and, for goal-directed navigation, whether the current location is a goal location.
If the assumption is incorrect, then the robot discovers at least one untraversable location that it did not know about and, thus, gains information.
In the example, D* changes the state value of location C1 (even though this location is still unvisited and, thus, has not been part of any local search space) when it discovers that locations C3 and D3 are untraversable because the layout of the environment implies that it takes now at least eight moves to reach the goal location instead of the six moves suggested by the heuristic function.