| | |
| | | private StationTaskTraceRegistry stationTaskTraceRegistry; |
| | | |
| | | public synchronized List<NavigateNode> calcByStationId(Integer startStationId, Integer endStationId) { |
| | | return calcByStationId(startStationId, endStationId, null, false); |
| | | return calcByStationId(startStationId, endStationId, null, null, false); |
| | | } |
| | | |
| | | public synchronized List<NavigateNode> calcByStationId(Integer startStationId, |
| | | Integer endStationId, |
| | | Double pathLenFactor) { |
| | | return calcByStationId(startStationId, endStationId, null, pathLenFactor, false); |
| | | } |
| | | |
| | | public synchronized List<NavigateNode> calcByStationId(Integer startStationId, Integer endStationId, Integer currentTaskNo) { |
| | | return calcByStationId(startStationId, endStationId, currentTaskNo, false); |
| | | return calcByStationId(startStationId, endStationId, currentTaskNo, null, false); |
| | | } |
| | | |
| | | public synchronized List<NavigateNode> calcByStationId(Integer startStationId, |
| | | Integer endStationId, |
| | | Integer currentTaskNo, |
| | | Double pathLenFactor) { |
| | | return calcByStationId(startStationId, endStationId, currentTaskNo, pathLenFactor, false); |
| | | } |
| | | |
| | | public synchronized List<NavigateNode> calcReachablePathByStationId(Integer startStationId, Integer endStationId) { |
| | | return calcByStationId(startStationId, endStationId, null, true); |
| | | return calcByStationId(startStationId, endStationId, null, null, true); |
| | | } |
| | | |
| | | public synchronized List<List<NavigateNode>> calcCandidatePathByStationId(Integer startStationId, |
| | | Integer endStationId, |
| | | Integer currentTaskNo) { |
| | | return calcCandidatePathByStationId(startStationId, endStationId, currentTaskNo, null); |
| | | } |
| | | |
| | | public synchronized List<List<NavigateNode>> calcCandidatePathByStationId(Integer startStationId, |
| | | Integer endStationId, |
| | | Integer currentTaskNo, |
| | | Double pathLenFactor) { |
| | | StationPathSearchContext context = buildStationPathSearchContext(startStationId, endStationId); |
| | | if (context.allList.isEmpty()) { |
| | | return new ArrayList<>(); |
| | |
| | | context.allList, |
| | | context.resolvedPolicy, |
| | | currentTaskNo, |
| | | pathLenFactor, |
| | | startStationId, |
| | | endStationId |
| | | ); |
| | |
| | | private synchronized List<NavigateNode> calcByStationId(Integer startStationId, |
| | | Integer endStationId, |
| | | Integer currentTaskNo, |
| | | Double pathLenFactor, |
| | | boolean reachabilityOnly) { |
| | | StationPathSearchContext context = buildStationPathSearchContext(startStationId, endStationId); |
| | | if (context.allList.isEmpty()) { |
| | |
| | | } |
| | | List<NavigateNode> list = reachabilityOnly |
| | | ? findStationReachablePath(context.allList, context.resolvedPolicy, startStationId, endStationId) |
| | | : findStationBestPathTwoStage(context.allList, context.resolvedPolicy, currentTaskNo, startStationId, endStationId); |
| | | : findStationBestPathTwoStage(context.allList, context.resolvedPolicy, currentTaskNo, pathLenFactor, startStationId, endStationId); |
| | | return normalizeStationPath(list); |
| | | } |
| | | |
| | |
| | | private List<NavigateNode> findStationBestPathTwoStage(List<List<NavigateNode>> allList, |
| | | StationPathResolvedPolicy resolvedPolicy, |
| | | Integer currentTaskNo, |
| | | Double pathLenFactor, |
| | | Integer startStationId, |
| | | Integer endStationId) { |
| | | List<List<NavigateNode>> orderedPathList = orderStationPathCandidates(allList, resolvedPolicy, currentTaskNo, startStationId, endStationId); |
| | | List<List<NavigateNode>> orderedPathList = orderStationPathCandidates(allList, resolvedPolicy, currentTaskNo, pathLenFactor, startStationId, endStationId); |
| | | if (orderedPathList.isEmpty()) { |
| | | return new ArrayList<>(); |
| | | } |
| | |
| | | private List<List<NavigateNode>> orderStationPathCandidates(List<List<NavigateNode>> allList, |
| | | StationPathResolvedPolicy resolvedPolicy, |
| | | Integer currentTaskNo, |
| | | Double pathLenFactor, |
| | | Integer startStationId, |
| | | Integer endStationId) { |
| | | if (allList == null || allList.isEmpty()) { |
| | |
| | | return new ArrayList<>(); |
| | | } |
| | | |
| | | metricsList.sort((a, b) -> compareDouble(a.staticCost, b.staticCost, a.turnCount, b.turnCount, a.pathLen, b.pathLen)); |
| | | applyPathLengthPreference(metricsList, profileConfig, globalPolicy, pathLenFactor); |
| | | metricsList.sort((a, b) -> compareStaticCandidateMetrics(a, b, pathLenFactor)); |
| | | PathCandidateMetrics preferred = metricsList.get(0); |
| | | int maxLen = (int) Math.ceil(preferred.pathLen * safeDouble(profileConfig.getS1MaxLenRatio(), 1.15d)); |
| | | int maxTurns = preferred.turnCount + safeInt(profileConfig.getS1MaxTurnDiff(), 1); |
| | |
| | | primaryMetrics = new ArrayList<>(primaryMetrics.subList(0, topK)); |
| | | } |
| | | |
| | | primaryMetrics.sort((a, b) -> compareDouble(a.dynamicCost, b.dynamicCost, a.pathLen, b.pathLen, a.turnCount, b.turnCount)); |
| | | secondaryMetrics.sort((a, b) -> compareDouble(a.dynamicCost, b.dynamicCost, a.pathLen, b.pathLen, a.turnCount, b.turnCount)); |
| | | primaryMetrics.sort((a, b) -> compareDynamicCandidateMetrics(a, b, pathLenFactor)); |
| | | secondaryMetrics.sort((a, b) -> compareDynamicCandidateMetrics(a, b, pathLenFactor)); |
| | | |
| | | List<PathCandidateMetrics> remainingMetrics = new ArrayList<>(); |
| | | for (PathCandidateMetrics metrics : metricsList) { |
| | |
| | | remainingMetrics.add(metrics); |
| | | } |
| | | } |
| | | remainingMetrics.sort((a, b) -> compareDouble(a.dynamicCost, b.dynamicCost, a.pathLen, b.pathLen, a.turnCount, b.turnCount)); |
| | | remainingMetrics.sort((a, b) -> compareDynamicCandidateMetrics(a, b, pathLenFactor)); |
| | | |
| | | List<List<NavigateNode>> orderedPathList = new ArrayList<>(); |
| | | appendCandidatePathList(orderedPathList, primaryMetrics); |
| | |
| | | double congWeightFactor = globalPolicy == null ? 1.0d : globalPolicy.congWeightFactor; |
| | | double passOtherOutStationPenaltyWeight = globalPolicy == null ? 0.0d : globalPolicy.passOtherOutStationPenaltyWeight; |
| | | |
| | | metrics.staticCost = |
| | | safeDouble(profileConfig.getS1LenWeight(), 1.0d) * lenWeightFactor * metrics.pathLen |
| | | + safeDouble(profileConfig.getS1TurnWeight(), 3.0d) * metrics.turnCount |
| | | metrics.baseLengthWeight = safeDouble(profileConfig.getS1LenWeight(), 1.0d) * lenWeightFactor; |
| | | metrics.otherStaticCost = |
| | | safeDouble(profileConfig.getS1TurnWeight(), 3.0d) * metrics.turnCount |
| | | + safeDouble(profileConfig.getS1LiftWeight(), 8.0d) * metrics.liftTransferCount |
| | | + passOtherOutStationPenaltyWeight * metrics.passOtherOutStationCount |
| | | + softDeviationWeight * metrics.softDeviationCount; |
| | |
| | | int leftLiftCount = countLiftTransferCount(left); |
| | | int rightLiftCount = countLiftTransferCount(right); |
| | | return compareDouble(leftLen, rightLen, leftTurnCount, rightTurnCount, leftLiftCount, rightLiftCount); |
| | | } |
| | | |
| | | private void applyPathLengthPreference(List<PathCandidateMetrics> metricsList, |
| | | StationPathProfileConfig profileConfig, |
| | | PathGlobalPolicy globalPolicy, |
| | | Double pathLenFactor) { |
| | | if (metricsList == null || metricsList.isEmpty()) { |
| | | return; |
| | | } |
| | | double normalizedFactor = normalizePathLenFactor(pathLenFactor); |
| | | int minPathLen = Integer.MAX_VALUE; |
| | | int maxPathLen = Integer.MIN_VALUE; |
| | | for (PathCandidateMetrics metrics : metricsList) { |
| | | if (metrics == null) { |
| | | continue; |
| | | } |
| | | minPathLen = Math.min(minPathLen, metrics.pathLen); |
| | | maxPathLen = Math.max(maxPathLen, metrics.pathLen); |
| | | } |
| | | if (minPathLen == Integer.MAX_VALUE || maxPathLen == Integer.MIN_VALUE) { |
| | | return; |
| | | } |
| | | double targetPathLen = normalizedFactor <= 0.0d || maxPathLen <= minPathLen |
| | | ? minPathLen |
| | | : minPathLen + normalizedFactor * (maxPathLen - minPathLen); |
| | | for (PathCandidateMetrics metrics : metricsList) { |
| | | if (metrics == null) { |
| | | continue; |
| | | } |
| | | metrics.pathLenPreferenceDistance = normalizedFactor <= 0.0d |
| | | ? metrics.pathLen |
| | | : Math.abs(metrics.pathLen - targetPathLen); |
| | | metrics.staticCost = metrics.baseLengthWeight * metrics.pathLenPreferenceDistance + metrics.otherStaticCost; |
| | | } |
| | | } |
| | | |
| | | private int compareStaticCandidateMetrics(PathCandidateMetrics left, |
| | | PathCandidateMetrics right, |
| | | Double pathLenFactor) { |
| | | if (left == right) { |
| | | return 0; |
| | | } |
| | | if (left == null) { |
| | | return 1; |
| | | } |
| | | if (right == null) { |
| | | return -1; |
| | | } |
| | | int result = Double.compare(left.staticCost, right.staticCost); |
| | | if (result != 0) { |
| | | return result; |
| | | } |
| | | result = Double.compare(left.pathLenPreferenceDistance, right.pathLenPreferenceDistance); |
| | | if (result != 0) { |
| | | return result; |
| | | } |
| | | result = Integer.compare(left.turnCount, right.turnCount); |
| | | if (result != 0) { |
| | | return result; |
| | | } |
| | | return comparePathLenTie(left.pathLen, right.pathLen, pathLenFactor); |
| | | } |
| | | |
| | | private int compareDynamicCandidateMetrics(PathCandidateMetrics left, |
| | | PathCandidateMetrics right, |
| | | Double pathLenFactor) { |
| | | if (left == right) { |
| | | return 0; |
| | | } |
| | | if (left == null) { |
| | | return 1; |
| | | } |
| | | if (right == null) { |
| | | return -1; |
| | | } |
| | | int result = Double.compare(left.dynamicCost, right.dynamicCost); |
| | | if (result != 0) { |
| | | return result; |
| | | } |
| | | result = Double.compare(left.pathLenPreferenceDistance, right.pathLenPreferenceDistance); |
| | | if (result != 0) { |
| | | return result; |
| | | } |
| | | result = comparePathLenTie(left.pathLen, right.pathLen, pathLenFactor); |
| | | if (result != 0) { |
| | | return result; |
| | | } |
| | | return Integer.compare(left.turnCount, right.turnCount); |
| | | } |
| | | |
| | | private int comparePathLenTie(int leftPathLen, int rightPathLen, Double pathLenFactor) { |
| | | double normalizedFactor = normalizePathLenFactor(pathLenFactor); |
| | | if (normalizedFactor <= 0.0d) { |
| | | return Integer.compare(leftPathLen, rightPathLen); |
| | | } |
| | | if (normalizedFactor >= 0.5d) { |
| | | return Integer.compare(rightPathLen, leftPathLen); |
| | | } |
| | | return Integer.compare(leftPathLen, rightPathLen); |
| | | } |
| | | |
| | | private int countLiftTransferCount(List<NavigateNode> path) { |
| | |
| | | return value == null ? defaultValue : value; |
| | | } |
| | | |
| | | private double normalizePathLenFactor(Double pathLenFactor) { |
| | | if (pathLenFactor == null) { |
| | | return 0.0d; |
| | | } |
| | | if (pathLenFactor < 0.0d) { |
| | | return 0.0d; |
| | | } |
| | | if (pathLenFactor > 1.0d) { |
| | | return 1.0d; |
| | | } |
| | | return pathLenFactor; |
| | | } |
| | | |
| | | private boolean notBlank(String text) { |
| | | return text != null && !text.trim().isEmpty(); |
| | | } |
| | |
| | | private int runBlockCount; |
| | | private int softDeviationCount; |
| | | private double loopPenalty; |
| | | private double baseLengthWeight; |
| | | private double otherStaticCost; |
| | | private double pathLenPreferenceDistance; |
| | | private double staticCost; |
| | | private double dynamicCost; |
| | | } |
| | |
| | | |
| | | StationCommand getCommand(StationCommandType commandType, Integer taskNo, Integer stationId, Integer targetStationId, Integer palletSize); |
| | | |
| | | default StationCommand getCommand(StationCommandType commandType, |
| | | Integer taskNo, |
| | | Integer stationId, |
| | | Integer targetStationId, |
| | | Integer palletSize, |
| | | Double pathLenFactor) { |
| | | return getCommand(commandType, taskNo, stationId, targetStationId, palletSize); |
| | | } |
| | | |
| | | default StationCommand getRunBlockRerouteCommand(Integer taskNo, |
| | | Integer stationId, |
| | | Integer targetStationId, |
| | |
| | | return getCommand(StationCommandType.MOVE, taskNo, stationId, targetStationId, palletSize); |
| | | } |
| | | |
| | | default StationCommand getRunBlockRerouteCommand(Integer taskNo, |
| | | Integer stationId, |
| | | Integer targetStationId, |
| | | Integer palletSize, |
| | | Double pathLenFactor) { |
| | | return getCommand(StationCommandType.MOVE, taskNo, stationId, targetStationId, palletSize, pathLenFactor); |
| | | } |
| | | |
| | | CommandResponse sendCommand(StationCommand command); |
| | | |
| | | CommandResponse sendOriginCommand(String address, short[] data); |
| | |
| | | |
| | | @Override |
| | | public StationCommand getCommand(StationCommandType commandType, Integer taskNo, Integer stationId, Integer targetStationId, Integer palletSize) { |
| | | return getCommand(commandType, taskNo, stationId, targetStationId, palletSize, null); |
| | | } |
| | | |
| | | @Override |
| | | public StationCommand getCommand(StationCommandType commandType, |
| | | Integer taskNo, |
| | | Integer stationId, |
| | | Integer targetStationId, |
| | | Integer palletSize, |
| | | Double pathLenFactor) { |
| | | StationCommand stationCommand = new StationCommand(); |
| | | stationCommand.setTaskNo(taskNo); |
| | | stationCommand.setStationId(stationId); |
| | |
| | | |
| | | if (commandType == StationCommandType.MOVE) { |
| | | if (!stationId.equals(targetStationId)) { |
| | | List<Integer> path = calcPathStationIds(stationId, targetStationId); |
| | | List<Integer> path = calcPathStationIds(taskNo, stationId, targetStationId, pathLenFactor); |
| | | if (path == null || path.isEmpty()) { |
| | | log.warn("输送线命令生成失败,路径为空,taskNo={}, stationId={}, targetStationId={}", |
| | | taskNo, stationId, targetStationId); |
| | |
| | | return zyStationConnectDriver.readOriginCommand(address, length); |
| | | } |
| | | |
| | | private List<Integer> calcPathStationIds(Integer startStationId, Integer targetStationId) { |
| | | private List<Integer> calcPathStationIds(Integer taskNo, |
| | | Integer startStationId, |
| | | Integer targetStationId, |
| | | Double pathLenFactor) { |
| | | NavigateUtils navigateUtils = SpringUtils.getBean(NavigateUtils.class); |
| | | if (navigateUtils == null) { |
| | | return new ArrayList<>(); |
| | | } |
| | | List<NavigateNode> nodes = navigateUtils.calcByStationId(startStationId, targetStationId); |
| | | List<NavigateNode> nodes = navigateUtils.calcByStationId(startStationId, targetStationId, taskNo, pathLenFactor); |
| | | List<Integer> ids = new ArrayList<>(); |
| | | for (NavigateNode n : nodes) { |
| | | JSONObject v = JSONObject.parseObject(n.getNodeValue()); |
| | |
| | | |
| | | @Override |
| | | public StationCommand getCommand(StationCommandType commandType, Integer taskNo, Integer stationId, Integer targetStationId, Integer palletSize) { |
| | | return getCommand(commandType, taskNo, stationId, targetStationId, palletSize, null); |
| | | } |
| | | |
| | | @Override |
| | | public StationCommand getCommand(StationCommandType commandType, |
| | | Integer taskNo, |
| | | Integer stationId, |
| | | Integer targetStationId, |
| | | Integer palletSize, |
| | | Double pathLenFactor) { |
| | | StationCommand stationCommand = new StationCommand(); |
| | | stationCommand.setTaskNo(taskNo); |
| | | stationCommand.setStationId(stationId); |
| | |
| | | |
| | | if (commandType == StationCommandType.MOVE) { |
| | | if (!stationId.equals(targetStationId)) { |
| | | List<NavigateNode> nodes = calcPathNavigateNodes(stationId, targetStationId); |
| | | List<NavigateNode> nodes = calcPathNavigateNodes(taskNo, stationId, targetStationId, pathLenFactor); |
| | | List<Integer> path = new ArrayList<>(); |
| | | List<Integer> liftTransferPath = new ArrayList<>(); |
| | | for (NavigateNode n : nodes) { |
| | |
| | | return zyStationConnectDriver.readOriginCommand(address, length); |
| | | } |
| | | |
| | | private List<NavigateNode> calcPathNavigateNodes(Integer startStationId, Integer targetStationId) { |
| | | private List<NavigateNode> calcPathNavigateNodes(Integer taskNo, |
| | | Integer startStationId, |
| | | Integer targetStationId, |
| | | Double pathLenFactor) { |
| | | NavigateUtils navigateUtils = SpringUtils.getBean(NavigateUtils.class); |
| | | if (navigateUtils == null) { |
| | | return new ArrayList<>(); |
| | | } |
| | | return navigateUtils.calcByStationId(startStationId, targetStationId); |
| | | return navigateUtils.calcByStationId(startStationId, targetStationId, taskNo, pathLenFactor); |
| | | } |
| | | |
| | | private void executeMoveWithSeg(StationCommand original) { |
| | |
| | | Integer stationId, |
| | | Integer targetStationId, |
| | | Integer palletSize) { |
| | | return getCommand(commandType, taskNo, stationId, targetStationId, palletSize, null); |
| | | } |
| | | |
| | | @Override |
| | | public StationCommand getCommand(StationCommandType commandType, |
| | | Integer taskNo, |
| | | Integer stationId, |
| | | Integer targetStationId, |
| | | Integer palletSize, |
| | | Double pathLenFactor) { |
| | | StationCommand stationCommand = new StationCommand(); |
| | | stationCommand.setTaskNo(taskNo); |
| | | stationCommand.setStationId(stationId); |
| | |
| | | stationCommand.setCommandType(commandType); |
| | | |
| | | if (commandType == StationCommandType.MOVE && !stationId.equals(targetStationId)) { |
| | | List<NavigateNode> nodes = calcPathNavigateNodes(taskNo, stationId, targetStationId); |
| | | List<NavigateNode> nodes = calcPathNavigateNodes(taskNo, stationId, targetStationId, pathLenFactor); |
| | | return fillMoveCommandPath(stationCommand, nodes, taskNo, stationId, targetStationId); |
| | | } |
| | | return stationCommand; |
| | |
| | | Integer stationId, |
| | | Integer targetStationId, |
| | | Integer palletSize) { |
| | | return getRunBlockRerouteCommand(taskNo, stationId, targetStationId, palletSize, null); |
| | | } |
| | | |
| | | @Override |
| | | public synchronized StationCommand getRunBlockRerouteCommand(Integer taskNo, |
| | | Integer stationId, |
| | | Integer targetStationId, |
| | | Integer palletSize, |
| | | Double pathLenFactor) { |
| | | if (taskNo == null || taskNo <= 0 || stationId == null || targetStationId == null) { |
| | | return null; |
| | | } |
| | | if (Objects.equals(stationId, targetStationId)) { |
| | | return getCommand(StationCommandType.MOVE, taskNo, stationId, targetStationId, palletSize); |
| | | return getCommand(StationCommandType.MOVE, taskNo, stationId, targetStationId, palletSize, pathLenFactor); |
| | | } |
| | | |
| | | RunBlockRerouteState rerouteState = loadRunBlockRerouteState(taskNo, stationId); |
| | |
| | | rerouteState.setPlanCount((rerouteState.getPlanCount() == null ? 0 : rerouteState.getPlanCount()) + 1); |
| | | rerouteState.setLastPlanTime(System.currentTimeMillis()); |
| | | |
| | | List<List<NavigateNode>> candidatePathList = calcCandidatePathNavigateNodes(taskNo, stationId, targetStationId); |
| | | List<List<NavigateNode>> candidatePathList = calcCandidatePathNavigateNodes(taskNo, stationId, targetStationId, pathLenFactor); |
| | | if (candidatePathList.isEmpty()) { |
| | | saveRunBlockRerouteState(rerouteState); |
| | | log.warn("输送线堵塞重规划失败,候选路径为空,taskNo={}, planCount={}, stationId={}, targetStationId={}", |
| | |
| | | return zyStationConnectDriver.readOriginCommand(address, length); |
| | | } |
| | | |
| | | private List<NavigateNode> calcPathNavigateNodes(Integer taskNo, Integer startStationId, Integer targetStationId) { |
| | | private List<NavigateNode> calcPathNavigateNodes(Integer taskNo, |
| | | Integer startStationId, |
| | | Integer targetStationId, |
| | | Double pathLenFactor) { |
| | | NavigateUtils navigateUtils = SpringUtils.getBean(NavigateUtils.class); |
| | | if (navigateUtils == null) { |
| | | return new ArrayList<>(); |
| | | } |
| | | return navigateUtils.calcByStationId(startStationId, targetStationId, taskNo); |
| | | return navigateUtils.calcByStationId(startStationId, targetStationId, taskNo, pathLenFactor); |
| | | } |
| | | |
| | | private List<List<NavigateNode>> calcCandidatePathNavigateNodes(Integer taskNo, |
| | | Integer startStationId, |
| | | Integer targetStationId) { |
| | | Integer targetStationId, |
| | | Double pathLenFactor) { |
| | | NavigateUtils navigateUtils = SpringUtils.getBean(NavigateUtils.class); |
| | | if (navigateUtils == null) { |
| | | return new ArrayList<>(); |
| | | } |
| | | return navigateUtils.calcCandidatePathByStationId(startStationId, targetStationId, taskNo); |
| | | return navigateUtils.calcCandidatePathByStationId(startStationId, targetStationId, taskNo, pathLenFactor); |
| | | } |
| | | |
| | | private StationCommand buildMoveCommand(Integer taskNo, |
| | |
| | | && stationProtocol.isLoading() |
| | | && stationProtocol.getTaskNo() == 0 |
| | | ) { |
| | | Double pathLenFactor = resolveOutboundPathLenFactor(wrkMast); |
| | | OutOrderDispatchDecision dispatchDecision = resolveOutboundDispatchDecision( |
| | | stationProtocol.getStationId(), |
| | | wrkMast, |
| | | outOrderList |
| | | outOrderList, |
| | | pathLenFactor |
| | | ); |
| | | Integer moveStaNo = dispatchDecision == null ? null : dispatchDecision.getTargetStationId(); |
| | | if (moveStaNo == null) { |
| | |
| | | } |
| | | |
| | | DispatchLimitConfig limitConfig = getDispatchLimitConfig(stationProtocol.getStationId(), moveStaNo); |
| | | LoopHitResult loopHitResult = findPathLoopHit(limitConfig, stationProtocol.getStationId(), moveStaNo, loadGuardState); |
| | | LoopHitResult loopHitResult = findPathLoopHit(limitConfig, stationProtocol.getStationId(), moveStaNo, loadGuardState, wrkMast, pathLenFactor); |
| | | |
| | | if (isDispatchBlocked(limitConfig, currentStationTaskCountRef[0], loadGuardState, loopHitResult.isThroughLoop())) { |
| | | return; |
| | | } |
| | | |
| | | StationCommand command = stationThread.getCommand(StationCommandType.MOVE, wrkMast.getWrkNo(), stationProtocol.getStationId(), moveStaNo, 0); |
| | | StationCommand command = buildOutboundMoveCommand( |
| | | stationThread, |
| | | wrkMast, |
| | | stationProtocol.getStationId(), |
| | | moveStaNo, |
| | | pathLenFactor |
| | | ); |
| | | if (command == null) { |
| | | News.taskInfo(wrkMast.getWrkNo(), "获取输送线命令失败"); |
| | | continue; |
| | |
| | | && stationProtocol.isLoading() |
| | | && stationProtocol.getTaskNo() == 0 |
| | | ) { |
| | | StationCommand command = stationThread.getCommand(StationCommandType.MOVE, wrkMast.getWrkNo(), stationProtocol.getStationId(), wrkMast.getStaNo(), 0); |
| | | Double pathLenFactor = resolveOutboundPathLenFactor(wrkMast); |
| | | StationCommand command = buildOutboundMoveCommand( |
| | | stationThread, |
| | | wrkMast, |
| | | stationProtocol.getStationId(), |
| | | wrkMast.getStaNo(), |
| | | pathLenFactor |
| | | ); |
| | | if (command == null) { |
| | | News.taskInfo(wrkMast.getWrkNo(), "获取输送线命令失败"); |
| | | continue; |
| | |
| | | } |
| | | } else { |
| | | //运行堵塞,重新计算路线 |
| | | Double pathLenFactor = resolveOutboundPathLenFactor(wrkMast); |
| | | OutOrderDispatchDecision dispatchDecision = resolveOutboundDispatchDecision( |
| | | stationProtocol.getStationId(), |
| | | wrkMast, |
| | | outOrderStationIds |
| | | outOrderStationIds, |
| | | pathLenFactor |
| | | ); |
| | | Integer moveStaNo = dispatchDecision == null ? null : dispatchDecision.getTargetStationId(); |
| | | if (moveStaNo == null || Objects.equals(moveStaNo, stationProtocol.getStationId())) { |
| | |
| | | wrkMast.getWrkNo(), |
| | | stationProtocol.getStationId(), |
| | | moveStaNo, |
| | | 0 |
| | | 0, |
| | | pathLenFactor |
| | | ); |
| | | if (command == null) { |
| | | News.taskInfo(wrkMast.getWrkNo(), |
| | |
| | | continue; |
| | | } |
| | | |
| | | Double pathLenFactor = resolveOutboundPathLenFactor(wrkMast); |
| | | OutOrderDispatchDecision dispatchDecision = resolveOutboundDispatchDecision( |
| | | stationProtocol.getStationId(), |
| | | wrkMast, |
| | | outOrderStationIds |
| | | outOrderStationIds, |
| | | pathLenFactor |
| | | ); |
| | | Integer moveStaNo = dispatchDecision == null ? null : dispatchDecision.getTargetStationId(); |
| | | if (moveStaNo == null || Objects.equals(moveStaNo, stationProtocol.getStationId())) { |
| | | continue; |
| | | } |
| | | |
| | | StationCommand command = stationThread.getCommand(StationCommandType.MOVE, wrkMast.getWrkNo(), stationProtocol.getStationId(), moveStaNo, 0); |
| | | StationCommand command = buildOutboundMoveCommand( |
| | | stationThread, |
| | | wrkMast, |
| | | stationProtocol.getStationId(), |
| | | moveStaNo, |
| | | pathLenFactor |
| | | ); |
| | | if (command == null) { |
| | | News.taskInfo(wrkMast.getWrkNo(), "获取输送线命令失败"); |
| | | continue; |
| | |
| | | continue; |
| | | } |
| | | |
| | | Double pathLenFactor = resolveOutboundPathLenFactor(wrkMast); |
| | | OutOrderDispatchDecision dispatchDecision = resolveOutboundDispatchDecision( |
| | | stationProtocol.getStationId(), |
| | | wrkMast, |
| | | outOrderList |
| | | outOrderList, |
| | | pathLenFactor |
| | | ); |
| | | Integer moveStaNo = dispatchDecision == null ? null : dispatchDecision.getTargetStationId(); |
| | | if (moveStaNo == null || Objects.equals(moveStaNo, stationProtocol.getStationId())) { |
| | | continue; |
| | | } |
| | | |
| | | StationCommand command = stationThread.getCommand(StationCommandType.MOVE, wrkMast.getWrkNo(), stationProtocol.getStationId(), moveStaNo, 0); |
| | | StationCommand command = buildOutboundMoveCommand( |
| | | stationThread, |
| | | wrkMast, |
| | | stationProtocol.getStationId(), |
| | | moveStaNo, |
| | | pathLenFactor |
| | | ); |
| | | if (command == null) { |
| | | News.taskInfo(wrkMast.getWrkNo(), "获取输送线命令失败"); |
| | | continue; |
| | |
| | | MessageQueue.offer(SlaveType.Devp, basDevp.getDevpNo(), new Task(2, command)); |
| | | } |
| | | } |
| | | } |
| | | |
| | | private StationCommand buildOutboundMoveCommand(StationThread stationThread, |
| | | WrkMast wrkMast, |
| | | Integer stationId, |
| | | Integer targetStationId, |
| | | Double pathLenFactor) { |
| | | if (stationThread == null || wrkMast == null) { |
| | | return null; |
| | | } |
| | | return stationThread.getCommand( |
| | | StationCommandType.MOVE, |
| | | wrkMast.getWrkNo(), |
| | | stationId, |
| | | targetStationId, |
| | | 0, |
| | | normalizePathLenFactor(pathLenFactor) |
| | | ); |
| | | } |
| | | |
| | | private List<NavigateNode> calcOutboundNavigatePath(WrkMast wrkMast, |
| | | Integer sourceStationId, |
| | | Integer targetStationId, |
| | | Double pathLenFactor) { |
| | | Double normalizedFactor = normalizePathLenFactor(pathLenFactor); |
| | | Integer currentTaskNo = wrkMast == null ? null : wrkMast.getWrkNo(); |
| | | if (currentTaskNo == null) { |
| | | return navigateUtils.calcByStationId(sourceStationId, targetStationId, normalizedFactor); |
| | | } |
| | | return navigateUtils.calcByStationId(sourceStationId, targetStationId, currentTaskNo, normalizedFactor); |
| | | } |
| | | |
| | | private Double resolveOutboundPathLenFactor(WrkMast wrkMast) { |
| | | if (!isBatchOutboundTaskWithSeq(wrkMast)) { |
| | | return 0.0d; |
| | | } |
| | | List<WrkMast> activeBatchTaskList = loadActiveBatchTaskList(wrkMast.getBatch()); |
| | | if (activeBatchTaskList.size() <= 1) { |
| | | return 0.0d; |
| | | } |
| | | |
| | | int activeTaskCount = 0; |
| | | int predecessorCount = 0; |
| | | for (WrkMast item : activeBatchTaskList) { |
| | | if (!isFactorCandidateTask(item)) { |
| | | continue; |
| | | } |
| | | activeTaskCount++; |
| | | if (item.getBatchSeq() < wrkMast.getBatchSeq()) { |
| | | predecessorCount++; |
| | | } |
| | | } |
| | | if (activeTaskCount <= 1 || predecessorCount <= 0) { |
| | | return 0.0d; |
| | | } |
| | | return normalizePathLenFactor((double) predecessorCount / (double) (activeTaskCount - 1)); |
| | | } |
| | | |
| | | private boolean isBatchOutboundTaskWithSeq(WrkMast wrkMast) { |
| | | return wrkMast != null |
| | | && Objects.equals(wrkMast.getIoType(), WrkIoType.OUT.id) |
| | | && !Cools.isEmpty(wrkMast.getBatch()) |
| | | && wrkMast.getBatchSeq() != null |
| | | && wrkMast.getWrkNo() != null; |
| | | } |
| | | |
| | | private List<WrkMast> loadActiveBatchTaskList(String batch) { |
| | | if (Cools.isEmpty(batch)) { |
| | | return Collections.emptyList(); |
| | | } |
| | | return wrkMastService.list(new QueryWrapper<WrkMast>() |
| | | .eq("io_type", WrkIoType.OUT.id) |
| | | .eq("batch", batch) |
| | | .notIn("wrk_sts", |
| | | WrkStsType.STATION_RUN_COMPLETE.sts, |
| | | WrkStsType.COMPLETE_OUTBOUND.sts, |
| | | WrkStsType.SETTLE_OUTBOUND.sts)); |
| | | } |
| | | |
| | | private boolean isFactorCandidateTask(WrkMast wrkMast) { |
| | | return wrkMast != null |
| | | && Objects.equals(wrkMast.getIoType(), WrkIoType.OUT.id) |
| | | && wrkMast.getBatchSeq() != null |
| | | && !"taskCancel".equals(wrkMast.getMk()); |
| | | } |
| | | |
| | | public List<Integer> getAllOutOrderList() { |
| | |
| | | |
| | | private OutOrderDispatchDecision resolveOutboundDispatchDecision(Integer currentStationId, |
| | | WrkMast wrkMast, |
| | | List<Integer> outOrderStationIds) { |
| | | List<Integer> outOrderStationIds, |
| | | Double pathLenFactor) { |
| | | if (wrkMast == null || wrkMast.getStaNo() == null) { |
| | | return null; |
| | | } |
| | |
| | | return new OutOrderDispatchDecision(wrkMast.getStaNo(), false); |
| | | } |
| | | Integer dispatchStationId = resolveDispatchOutOrderTarget( |
| | | wrkMast, |
| | | wrkMast.getSourceStaNo(), |
| | | wrkMast.getStaNo(), |
| | | outOrderStationIds |
| | | outOrderStationIds, |
| | | pathLenFactor |
| | | ); |
| | | if (dispatchStationId == null) { |
| | | return null; |
| | | } |
| | | if (isCurrentOutOrderDispatchStation(currentStationId, wrkMast, outOrderStationIds)) { |
| | | return resolveCurrentOutOrderDispatchDecision(currentStationId, wrkMast, outOrderStationIds); |
| | | if (isCurrentOutOrderDispatchStation(currentStationId, wrkMast, outOrderStationIds, pathLenFactor)) { |
| | | return resolveCurrentOutOrderDispatchDecision(currentStationId, wrkMast, outOrderStationIds, pathLenFactor); |
| | | } |
| | | if (!Objects.equals(dispatchStationId, wrkMast.getStaNo()) |
| | | && isCurrentOutOrderStation(currentStationId, outOrderStationIds) |
| | |
| | | |
| | | private OutOrderDispatchDecision resolveCurrentOutOrderDispatchDecision(Integer currentStationId, |
| | | WrkMast wrkMast, |
| | | List<Integer> outOrderStationIds) { |
| | | if (!isCurrentOutOrderDispatchStation(currentStationId, wrkMast, outOrderStationIds)) { |
| | | List<Integer> outOrderStationIds, |
| | | Double pathLenFactor) { |
| | | if (!isCurrentOutOrderDispatchStation(currentStationId, wrkMast, outOrderStationIds, pathLenFactor)) { |
| | | return null; |
| | | } |
| | | |
| | |
| | | |
| | | List<NavigateNode> initPath; |
| | | try { |
| | | initPath = navigateUtils.calcByStationId(wrkMast.getSourceStaNo(), wrkMast.getStaNo()); |
| | | initPath = calcOutboundNavigatePath(wrkMast, wrkMast.getSourceStaNo(), wrkMast.getStaNo(), pathLenFactor); |
| | | } catch (Exception e) { |
| | | News.taskInfo(wrkMast.getWrkNo(), "批次:{} 计算排序路径失败,当前站点={}", wrkMast.getBatch(), currentStationId); |
| | | return null; |
| | |
| | | toTarget = Integer.valueOf(seq + 1).equals(wrkMast.getBatchSeq()); |
| | | } |
| | | if (toTarget) { |
| | | if (hasReachableOutReleaseSlot(currentStationId, wrkMast.getStaNo())) { |
| | | if (hasReachableOutReleaseSlot(wrkMast, currentStationId, wrkMast.getStaNo(), pathLenFactor)) { |
| | | return new OutOrderDispatchDecision(wrkMast.getStaNo(), false); |
| | | } |
| | | StationTaskLoopService.LoopEvaluation loopEvaluation = evaluateOutOrderLoop( |
| | |
| | | outOrderStationIds |
| | | ); |
| | | Integer circleTarget = resolveNextCircleOrderTarget( |
| | | wrkMast, |
| | | currentStationId, |
| | | outOrderStationIds, |
| | | loopEvaluation.getExpectedLoopIssueCount() |
| | | loopEvaluation.getExpectedLoopIssueCount(), |
| | | pathLenFactor |
| | | ); |
| | | if (circleTarget == null) { |
| | | News.taskInfo(wrkMast.getWrkNo(), "目标站当前不可进,且未找到可执行的下一排序检测点,当前站点={}", currentStationId); |
| | |
| | | outOrderStationIds |
| | | ); |
| | | Integer circleTarget = resolveNextCircleOrderTarget( |
| | | wrkMast, |
| | | currentStationId, |
| | | outOrderStationIds, |
| | | loopEvaluation.getExpectedLoopIssueCount() |
| | | loopEvaluation.getExpectedLoopIssueCount(), |
| | | pathLenFactor |
| | | ); |
| | | if (circleTarget == null) { |
| | | News.taskInfo(wrkMast.getWrkNo(), "未找到可执行的下一排序检测点,当前站点={}", currentStationId); |
| | |
| | | |
| | | private boolean isCurrentOutOrderDispatchStation(Integer currentStationId, |
| | | WrkMast wrkMast, |
| | | List<Integer> outOrderStationIds) { |
| | | List<Integer> outOrderStationIds, |
| | | Double pathLenFactor) { |
| | | if (!shouldApplyOutOrder(wrkMast, outOrderStationIds) || currentStationId == null) { |
| | | return false; |
| | | } |
| | | Integer dispatchStationId = resolveDispatchOutOrderTarget( |
| | | wrkMast, |
| | | wrkMast.getSourceStaNo(), |
| | | wrkMast.getStaNo(), |
| | | outOrderStationIds |
| | | outOrderStationIds, |
| | | pathLenFactor |
| | | ); |
| | | return dispatchStationId != null |
| | | && !Objects.equals(dispatchStationId, wrkMast.getStaNo()) |
| | |
| | | ); |
| | | } |
| | | |
| | | private Integer resolveDispatchOutOrderTarget(Integer sourceStationId, |
| | | private Integer resolveDispatchOutOrderTarget(WrkMast wrkMast, |
| | | Integer sourceStationId, |
| | | Integer finalTargetStationId, |
| | | List<Integer> outOrderList) { |
| | | List<Integer> outOrderList, |
| | | Double pathLenFactor) { |
| | | if (finalTargetStationId == null) { |
| | | return null; |
| | | } |
| | |
| | | } |
| | | |
| | | try { |
| | | List<NavigateNode> nodes = navigateUtils.calcByStationId(sourceStationId, finalTargetStationId); |
| | | List<NavigateNode> nodes = calcOutboundNavigatePath(wrkMast, sourceStationId, finalTargetStationId, pathLenFactor); |
| | | for (int i = nodes.size() - 1; i >= 0; i--) { |
| | | Integer stationId = getStationIdFromNode(nodes.get(i)); |
| | | if (stationId == null) { |
| | |
| | | return finalTargetStationId; |
| | | } |
| | | |
| | | private boolean hasReachableOutReleaseSlot(Integer currentStationId, |
| | | Integer finalTargetStationId) { |
| | | private boolean hasReachableOutReleaseSlot(WrkMast wrkMast, |
| | | Integer currentStationId, |
| | | Integer finalTargetStationId, |
| | | Double pathLenFactor) { |
| | | if (currentStationId == null || finalTargetStationId == null) { |
| | | return true; |
| | | } |
| | | |
| | | try { |
| | | List<NavigateNode> nodes = navigateUtils.calcByStationId(currentStationId, finalTargetStationId); |
| | | List<NavigateNode> nodes = calcOutboundNavigatePath(wrkMast, currentStationId, finalTargetStationId, pathLenFactor); |
| | | if (nodes == null || nodes.isEmpty()) { |
| | | return true; |
| | | } |
| | |
| | | || (stationProtocol.getTaskNo() != null && stationProtocol.getTaskNo() > 0); |
| | | } |
| | | |
| | | private Integer resolveNextCircleOrderTarget(Integer currentStationId, |
| | | private Integer resolveNextCircleOrderTarget(WrkMast wrkMast, |
| | | Integer currentStationId, |
| | | List<Integer> orderedOutStationList, |
| | | Integer expectedLoopIssueCount) { |
| | | Integer expectedLoopIssueCount, |
| | | Double pathLenFactor) { |
| | | if (currentStationId == null || orderedOutStationList == null || orderedOutStationList.size() <= 1) { |
| | | return null; |
| | | } |
| | |
| | | continue; |
| | | } |
| | | try { |
| | | List<NavigateNode> path = navigateUtils.calcByStationId(currentStationId, candidateStationId); |
| | | List<NavigateNode> path = calcOutboundNavigatePath(wrkMast, currentStationId, candidateStationId, pathLenFactor); |
| | | if (path != null && !path.isEmpty()) { |
| | | candidateList.add(new CircleTargetCandidate(candidateStationId, path.size(), offset)); |
| | | } |
| | |
| | | return Integer.compare(left.getOffset(), right.getOffset()); |
| | | } |
| | | }); |
| | | return resolveGradualCircleTargetByPathLength(expectedLoopIssueCount, candidateList); |
| | | return resolveGradualCircleTargetByPathLength(expectedLoopIssueCount, candidateList, pathLenFactor); |
| | | } |
| | | |
| | | private Integer resolveGradualCircleTargetByPathLength(Integer expectedLoopIssueCount, |
| | | List<CircleTargetCandidate> candidateList) { |
| | | List<CircleTargetCandidate> candidateList, |
| | | Double pathLenFactor) { |
| | | if (candidateList == null || candidateList.isEmpty()) { |
| | | return null; |
| | | } |
| | | if (expectedLoopIssueCount == null || expectedLoopIssueCount <= 2) { |
| | | return candidateList.get(0).getStationId(); |
| | | } |
| | | |
| | | List<CircleTargetCandidate> tierList = new ArrayList<>(); |
| | |
| | | if (tierList.isEmpty()) { |
| | | return candidateList.get(0).getStationId(); |
| | | } |
| | | int tierIndex = Math.min(expectedLoopIssueCount - 2, tierList.size() - 1); |
| | | int defaultTierIndex = expectedLoopIssueCount == null || expectedLoopIssueCount <= 2 |
| | | ? 0 |
| | | : Math.min(expectedLoopIssueCount - 2, tierList.size() - 1); |
| | | int factorTierIndex = (int) Math.round(normalizePathLenFactor(pathLenFactor) * (tierList.size() - 1)); |
| | | int tierIndex = Math.max(defaultTierIndex, factorTierIndex); |
| | | return tierList.get(tierIndex).getStationId(); |
| | | } |
| | | |
| | |
| | | return; |
| | | } |
| | | |
| | | Double pathLenFactor = resolveOutboundPathLenFactor(wrkMast); |
| | | OutOrderDispatchDecision dispatchDecision = null; |
| | | Integer moveStaNo; |
| | | if (Objects.equals(wrkMast.getWrkSts(), WrkStsType.STATION_RUN.sts)) { |
| | | dispatchDecision = resolveOutboundDispatchDecision(stationProtocol.getStationId(), wrkMast, outOrderList); |
| | | dispatchDecision = resolveOutboundDispatchDecision(stationProtocol.getStationId(), wrkMast, outOrderList, pathLenFactor); |
| | | moveStaNo = dispatchDecision == null ? null : dispatchDecision.getTargetStationId(); |
| | | } else { |
| | | moveStaNo = wrkMast.getStaNo(); |
| | |
| | | resetSegmentMoveCommandsBeforeReroute(stationProtocol.getTaskNo()); |
| | | int clearedCommandCount = clearIssuedMoveCommandsDuringIdleStay(idleTrack, stationProtocol.getTaskNo(), stationProtocol.getStationId()); |
| | | |
| | | StationCommand command = stationThread.getCommand( |
| | | StationCommandType.MOVE, |
| | | wrkMast.getWrkNo(), |
| | | StationCommand command = buildOutboundMoveCommand( |
| | | stationThread, |
| | | wrkMast, |
| | | stationProtocol.getStationId(), |
| | | moveStaNo, |
| | | 0 |
| | | pathLenFactor |
| | | ); |
| | | if (command == null) { |
| | | News.taskInfo(wrkMast.getWrkNo(), "站点任务停留超时后重算路径失败,当前站点={},目标站点={}", stationProtocol.getStationId(), moveStaNo); |
| | |
| | | Integer sourceStationId, |
| | | Integer targetStationId, |
| | | LoadGuardState loadGuardState) { |
| | | return findPathLoopHit(config, sourceStationId, targetStationId, loadGuardState, null, null); |
| | | } |
| | | |
| | | private LoopHitResult findPathLoopHit(DispatchLimitConfig config, |
| | | Integer sourceStationId, |
| | | Integer targetStationId, |
| | | LoadGuardState loadGuardState, |
| | | WrkMast wrkMast, |
| | | Double pathLenFactor) { |
| | | if (!config.loopModeEnable) { |
| | | return LoopHitResult.NO_HIT; |
| | | } |
| | |
| | | } |
| | | |
| | | try { |
| | | List<NavigateNode> nodes = navigateUtils.calcByStationId(sourceStationId, targetStationId); |
| | | List<NavigateNode> nodes = wrkMast == null |
| | | ? navigateUtils.calcByStationId(sourceStationId, targetStationId) |
| | | : calcOutboundNavigatePath(wrkMast, sourceStationId, targetStationId, pathLenFactor); |
| | | if (nodes == null || nodes.isEmpty()) { |
| | | return LoopHitResult.NO_HIT; |
| | | } |
| | |
| | | return value; |
| | | } |
| | | |
| | | private Double normalizePathLenFactor(Double pathLenFactor) { |
| | | if (pathLenFactor == null || pathLenFactor < 0.0d) { |
| | | return 0.0d; |
| | | } |
| | | if (pathLenFactor > 1.0d) { |
| | | return 1.0d; |
| | | } |
| | | return pathLenFactor; |
| | | } |
| | | |
| | | private static class OutOrderDispatchDecision { |
| | | private final Integer targetStationId; |
| | | private final boolean circle; |