| | |
| | | } |
| | | } |
| | | |
| | | //寻找离任务楼层最近的穿梭车(不考虑跨楼层小车移动距离) |
| | | // |
| | | if (!diffLev.isEmpty()) { |
| | | Map<Integer, ShuttleThread> diffShuttles = new TreeMap<>();//自然排序小车Map |
| | | //获取任务 |
| | |
| | | //给工作档绑定小车号 |
| | | diffShuttles.put(-1, shuttleThread); |
| | | } else { |
| | | if (tongLev && diffLev.size() >= 2) { |
| | | //当前穿梭车线程到目标地点距离 |
| | | List<NavigateNode> currentShuttlePath = navigateUtils.calc(currentLocNo, locNo, NavigationMapType.NORMAL.id, Utils.getShuttlePoints(shuttleProtocol.getShuttleNo(), Utils.getLev(currentLocNo)), null);//搜索空闲穿梭车,使用正常通道地图 |
| | | if (currentShuttlePath == null) { |
| | | continue; |
| | | } |
| | | Integer currentAllDistance = navigateUtils.getOriginPathAllDistance(currentShuttlePath);//计算当前路径行走总距离 |
| | | diffShuttles.put(currentAllDistance, shuttleThread); |
| | | } else { |
| | | // if (tongLev && diffLev.size() >= 2) { |
| | | // //当前穿梭车线程到目标地点距离 |
| | | // List<NavigateNode> currentShuttlePath = navigateUtils.calc(currentLocNo, locNo, NavigationMapType.NORMAL.id, Utils.getShuttlePoints(shuttleProtocol.getShuttleNo(), Utils.getLev(currentLocNo)), null);//搜索空闲穿梭车,使用正常通道地图 |
| | | // if (currentShuttlePath == null) { |
| | | // continue; |
| | | // } |
| | | // Integer currentAllDistance = navigateUtils.getOriginPathAllDistance(currentShuttlePath);//计算当前路径行走总距离 |
| | | // diffShuttles.put(currentAllDistance, shuttleThread); |
| | | // } else { |
| | | //ABS(目标楼层 - 当前楼层) 得到差距,取最小差值 |
| | | int currentValue = Math.abs(lev - currentLev); |
| | | if (diffShuttles.get(currentValue) != null) { |
| | |
| | | } else { |
| | | diffShuttles.put(currentValue, shuttleThread); |
| | | } |
| | | } |
| | | // } |
| | | } |
| | | } |
| | | |