def __init__(self, title, occupancyGrid): CellBasedForwardSearch.__init__(self, title, occupancyGrid) self.fifoQueue = deque() # changes self.queueLength = len(self.fifoQueue) self.maxQueueLength = self.queueLength self.nCellsDead= len(self.fifoQueue)
def __init__(self, title, occupancyGrid): CellBasedForwardSearch.__init__(self, title, occupancyGrid) self.fifoQueue = deque()
def __init__(self, title, occupancyGrid): CellBasedForwardSearch.__init__(self, title, occupancyGrid) self.lifoQueue = list() self._curLenOfQueue = 0 self._maxLenOfQueue = 0
def __init__(self, title, occupancyGrid): CellBasedForwardSearch.__init__(self, title, occupancyGrid) self.astar0Queue = []
def __init__(self, title, occupancyGrid): CellBasedForwardSearch.__init__(self, title, occupancyGrid) self._queue = PriorityQueueByCost() self._curLenOfQueue = 0 self._maxLenOfQueue = 0
def __init__(self, title, occupancyGrid): CellBasedForwardSearch.__init__(self, title, occupancyGrid) self.dijkstraQueue = []
def __init__(self, title, occupancyGrid): CellBasedForwardSearch.__init__(self, title, occupancyGrid) self.priorityQueue = PriorityQueue()
def __init__(self, title, occupancyGrid, heuristic, constant, hscale=0): CellBasedForwardSearch.__init__(self, title, occupancyGrid) self.aQueue = dict() self.Heuristic = heuristic self.scale = hscale self.const = constant
def __init__(self, title, occupancyGrid): CellBasedForwardSearch.__init__(self, title, occupancyGrid) self.bestQueue = dict()
def __init__(self, title, occupancyGrid): CellBasedForwardSearch.__init__(self, title, occupancyGrid) self.greedyQueue = PriorityQueue() self.temporaryQueue = PriorityQueue()
def __init__(self, title, occupancyGrid): CellBasedForwardSearch.__init__(self, title, occupancyGrid) self.priorityQueue = PriorityQueue() self.frontier = None self.frontierGot = False
def __init__(self, title, occupancyGrid, heuristic, scale=0): CellBasedForwardSearch.__init__(self, title, occupancyGrid) self.lifoQueue = list() self.heuristic = heuristic self.scale = scale