Uses of Class
eu.iv4xr.framework.extensions.pathfinding.Sparse2DTiledSurface_NavGraph.Tile
Package
Description
This package provides classes to do pathfinding over a graph.
This package contains the implementation of iv4xr Env, State,
TacticLib, GoalLib etc, which are necessary to allow an aplib/iv4xr
test agent to control the game in the smart way.
-
Uses of Sparse2DTiledSurface_NavGraph.Tile in eu.iv4xr.framework.extensions.pathfinding
Modifier and TypeClassDescriptionstatic class
static class
static class
Modifier and TypeFieldDescription(package private) Set<Sparse2DTiledSurface_NavGraph.Tile>
Sparse2DTiledSurface_NavGraph.frontierCandidates
Sparse2DTiledSurface_NavGraph.pathfinder
Modifier and TypeMethodDescriptionSparse2DTiledSurface_NavGraph.explore(int x, int y, int heuristicX, int heuristicY)
Sparse2DTiledSurface_NavGraph.explore(Sparse2DTiledSurface_NavGraph.Tile startingLocation, Sparse2DTiledSurface_NavGraph.Tile heuristicLocation)
Sparse2DTiledSurface_NavGraph.findPath(int fromX, int fromY, int toX, int toY)
Sparse2DTiledSurface_NavGraph.findPath(Sparse2DTiledSurface_NavGraph.Tile from, Sparse2DTiledSurface_NavGraph.Tile to)
Sparse2DTiledSurface_NavGraph.getFrontier()
This returns the set of frontier-tiles.Sparse2DTiledSurface_NavGraph.neighbours(Sparse2DTiledSurface_NavGraph.Tile t)
Return the neighbors of a tile.Sparse2DTiledSurface_NavGraph.neighbours_(int x, int y)
Return the neighbors of a tile.Sparse2DTiledSurface_NavGraph.physicalNeighbours(int x, int y)
Return the neighbors of a tile.Modifier and TypeMethodDescriptionvoid
Sparse2DTiledSurface_NavGraph.addObstacle(Sparse2DTiledSurface_NavGraph.Tile o)
Add a non-navigable tile (obstacle).float
Sparse2DTiledSurface_NavGraph.distance(Sparse2DTiledSurface_NavGraph.Tile from, Sparse2DTiledSurface_NavGraph.Tile to)
The distance between two neighboring tiles.Sparse2DTiledSurface_NavGraph.explore(Sparse2DTiledSurface_NavGraph.Tile startingLocation, Sparse2DTiledSurface_NavGraph.Tile heuristicLocation)
Sparse2DTiledSurface_NavGraph.findPath(Sparse2DTiledSurface_NavGraph.Tile from, Sparse2DTiledSurface_NavGraph.Tile to)
boolean
Sparse2DTiledSurface_NavGraph.hasbeenSeen(Sparse2DTiledSurface_NavGraph.Tile tile)
float
Sparse2DTiledSurface_NavGraph.heuristic(Sparse2DTiledSurface_NavGraph.Tile from, Sparse2DTiledSurface_NavGraph.Tile to)
The estimated distance between two arbitrary vertices.boolean
Sparse2DTiledSurface_NavGraph.isBlocking(Sparse2DTiledSurface_NavGraph.Tile tile)
The tile is blocking (true) if it is a wall or a closed door.void
Sparse2DTiledSurface_NavGraph.markAsSeen(Sparse2DTiledSurface_NavGraph.Tile p)
Sparse2DTiledSurface_NavGraph.neighbours(Sparse2DTiledSurface_NavGraph.Tile t)
Return the neighbors of a tile.void
Sparse2DTiledSurface_NavGraph.removeObstacle(Sparse2DTiledSurface_NavGraph.Tile o)
Remove a non-navigable tile (obstacle).void
Sparse2DTiledSurface_NavGraph.setBlockingState(Sparse2DTiledSurface_NavGraph.Tile tile, boolean isBlocking)
Modifier and TypeMethodDescriptionvoid
Sparse2DTiledSurface_NavGraph.markAsSeen(List<Sparse2DTiledSurface_NavGraph.Tile> newlyseen)
-
Uses of Sparse2DTiledSurface_NavGraph.Tile in nl.uu.cs.aplib.exampleUsages.miniDungeon.testAgent
Modifier and TypeMethodDescriptionModifier and TypeMethodDescriptionstatic List<Pair<Integer,Sparse2DTiledSurface_NavGraph.Tile>>
TacticLib.adjustedFindPath(MyAgentState state, int maze0, int x0, int y0, int maze1, int x1, int y1)
Calculate a path from (x0,y0) in maze-0 to (x1,y1) in maze-1.(package private) static Pair<Integer,Sparse2DTiledSurface_NavGraph.Tile>
Utils.loc3(int mazeId, int x, int y)
Modifier and TypeMethodDescriptionstatic boolean
Utils.adjacent(Sparse2DTiledSurface_NavGraph.Tile tile1, Sparse2DTiledSurface_NavGraph.Tile tile2)
Check if two tiles are adjacent.static int
(package private) WorldModel
TacticLib.moveTo(MyAgentState state, Sparse2DTiledSurface_NavGraph.Tile targetTile)
Modifier and TypeMethodDescriptionTacticLib.explore(Pair<Integer,Sparse2DTiledSurface_NavGraph.Tile> heuristicLocation)
(package private) Action
TacticLib.exploreAction(Pair<Integer,Sparse2DTiledSurface_NavGraph.Tile> heuristicLocation)
Construct an action that would explore the world, in the direction of the given location.GoalLib.exploring(Pair<Integer,Sparse2DTiledSurface_NavGraph.Tile> heuristicLocation, int budget)
TacticLib.navigateToTac(Pair<Integer,Sparse2DTiledSurface_NavGraph.Tile> location)
GoalLib.positionInCloseRange(Pair<Integer,Sparse2DTiledSurface_NavGraph.Tile> p)
GoalLib.smartExploring(TestAgent agent, Pair<Integer,Sparse2DTiledSurface_NavGraph.Tile> heuristicLocation, int budget)