walker.blue.path.lib.floor

Class FloorSequencer

java.lang.Object

walker.blue.path.lib.floor.FloorSequencer

public class FloorSequencer
extends java.lang.Object

This class sequences together 2D paths generated from a GridAStar object to form an approximate shortest 3D path specific to building navigation.

Constructor Summary

Constructors

Constructor and Description
FloorSequencer(GridAStar pathfinder, java.util.List<java.util.List<java.util.List<GridNode>>> searchArea, java.util.List<FloorConnector> floorConnectors) Class contructor

Method Summary

Modifier and Type	Method and Description
java.util.List<GridNode>	findPath(GridNode start, GridNode dest) Calculates the approximate shortest path from the start node to the dest node even when both nodes are on different floors.
void	printFloorSequences(java.util.List<java.util.List<GridNode>> floorSequences) Prints the given floor sequences in an easy-to-view format.
void	printPath(java.util.List<java.util.List<java.util.List<GridNode>>> searchArea, java.util.List<GridNode> path) Prints the given path over top of the given 3D search area in an easy-to-view format.

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

FloorSequencer

public FloorSequencer(GridAStar pathfinder,
                      java.util.List<java.util.List<java.util.List<GridNode>>> searchArea,
                      java.util.List<FloorConnector> floorConnectors)

Class contructor

Parameters:

pathfinder - Patfinder used to calculate paths

searchArea - Search area for the building

floorConnectors - Floor connectors for the building

Method Detail

findPath

public java.util.List<GridNode> findPath(GridNode start,
                                         GridNode dest)

Calculates the approximate shortest path from the start node to the dest node even when both nodes are on different floors. Once every possible sequence of floor connectors to move from the start node's floor to the dest node's floor is calculated, the connectors in each sequence are used as start and end nodes in the 2D path search, which uses the pathfinder member object. The shortest path is assumed to be the multi-floor path that is calculated the quickest due to fewer nodes having to be visited. Of course, this is dependent upon CPU load. Technically, a longer path could be calculated quicker than a shorter path if when the shorter path was being calculated, the CPU had a greater load from external applications outside of the navigation system.

Parameters:

start - the start node

dest - the end node

Returns:

the path from the start to dest nodes as a List of GridNodes

printFloorSequences

public void printFloorSequences(java.util.List<java.util.List<GridNode>> floorSequences)

Prints the given floor sequences in an easy-to-view format.

Parameters:

floorSequences - list of node sequences

printPath

public void printPath(java.util.List<java.util.List<java.util.List<GridNode>>> searchArea,
                      java.util.List<GridNode> path)

Prints the given path over top of the given 3D search area in an easy-to-view format.

Parameters:

searchArea - the 3D list of nodes representing the building layout

path - the list of nodes that make up the path