#

luxiaotao1123

2024-11-26 c7ac2c8bb899b0785daaa9f72a69581bdb93fef1

 zy-acs-manager/src/main/java/com/zy/acs/manager/core/service/astart/AStarNavigateService.java

@@ -59,32 +59,15 @@
        DynamicNode[][] dynamicMatrix = mapDataDispatcher.getDynamicMatrix(null);
        String[][] waveMatrix = mapDataDispatcher.getWaveMatrix(null);

//        List<String> included = new ArrayList<>();
//        if (!Cools.isEmpty(whiteList)) {
//            included.addAll(whiteList);
//        }
//        included.add(agvNo);
//        List<VehicleDto> vehicleDtoList = agvService.getVehicleDtoList(included);

        while (openQueue.size() > 0) {
            // 取优先队列顶部元素并且把这个元素从Open表中删除，取F值最小的节点
            NavigateNode currentNode = openQueue.poll();
            // 对当前结点进行扩展，得到一个四周结点的数组

            ArrayList<NavigateNode> neighbourNodes = this.getNeighborNodes(currentNode, mapMatrix, existNodes);
            // 对这个结点遍历，看是否有目标结点出现
            label: for (NavigateNode node : neighbourNodes) {
            for (NavigateNode node : neighbourNodes) {
                boolean isEndNode = node.getX() == end.getX() && node.getY() == end.getY();

                int weight = 0;
                // 节点存在其他车辆
//                for (VehicleDto vehicleDto : vehicleDtoList) {
//                    if (node.getCodeData().equals(vehicleDto.getPosCode())) {
//                        if (!Cools.isEmpty(blackList) && blackList.contains(vehicleDto.getVehicle())) {
//                            continue label;
//                        }
//                        if (lock) {
//                            continue label;
//                        }
//                    }
//                }

                if (!Cools.isEmpty(blackList) && blackList.contains(node.getCodeData())) {
                    continue;
@@ -146,16 +129,13 @@
                    }

                    if (lanVehicleSet.size() + 1 > maxAgvCountInLane) {
//                        if (lock) {
//                            continue;
//                        }
                        continue;
                    }
                }


                //找到目标结点就返回
                if (node.getX() == end.getX() && node.getY() == end.getY()) {
                if (isEndNode) {
                    //并且计算出G， F， H等值
                    node.initNode(currentNode, end);
                    return node;