个性化学习路径推荐综述

近年来，伴随着现代信息技术的迅猛发展，以人工智能为代表的新兴技术在教育领域得到了广泛应用，引发了学习理念和方式的深刻变革.在这种大背景下，在线学习超越了时空的限制，为学习者“随时随地”学习提供了更多的可能性，从而得到了蓬勃发展.然而，在线学习中师生时间、空间分离的特征，导致教师无法及时掌握学生的学习状态，一定程度上制约了在线学习中教学质量的提升.面对多元化的学习需求及海量学习资源，如何迅速完成学习目标、降低学习成本、合理分配学习资源等问题成为限制个人和时代发展的重大问题.然而，传统的“一刀切”的教育模式已经不能满足人们获取知识的需求了，需要一个更高效、更科学的个性化教育模式，以帮助学习者以最小的学习成本最大限度地完成学习目标.基于以上背景，如何自动高效识别学习者特征，高效地组织和分配学习资源，为每一位学习者规划个性化路径，成为面向个体的精准化教育资源匹配机制研究中亟待解决的问题.系统地综述并分析了当前个性化学习路径推荐的研究现状，并从多学科领域的角度分析了对于同一问题的不同研究思路，同时也归纳总结了当前研究中最为主流的核心推荐算法.最后，强调当前研究存在的主要不足之处.     

Drivers of revitalization in Great Lakes coastal communities

Sediment remediation and habitat restoration projects have been increasingly employed along the coast of the Great Lakes to improve environmental quality since the designation of 43 highly degraded Areas of Concern (AOCs) by the 1987 Great Lakes Water Quality Agreement between the U.S. and Canada. Improvements in water quality, habitat, and other environmental conditions can also support community wellbeing and revitalization; however, the mechanisms that support these connections are relatively unclear. We address this gap through a case study of three AOCs near Lake Michigan: 1) Grand Calumet River; 2) White Lake, and 3) Muskegon Lake. By analyzing secondary data and planning documents, we found that alongside environmental cleanup, anchor institutions, housing and economic development, and local events drive revitalization. Our research also illustrates that, rather than acting as discrete processes, environmental cleanup and revitalization drivers overlap in time and space. Finally, our research reveals a high level of variation within and across AOCs in terms of diverse socioeconomic contexts, planning capacities, and existing partnerships. Together, our findings point to the need for collaborative and inclusive planning processes that account for the heterogeneity present within and across AOCs to simultaneously support remediation, restoration, and revitalization and to sustain continued revitalization in AOC communities after delisting.     

A mathematical model for open pit mine production scheduling with Grade Engineering® and stockpiling

This paper presents the development and implementation of an innovative mixed integer programming based mathematical model for an open pit mining operation with Grade Engineering framework. Grade Engineering comprises a range of coarse-separation based pre-processing techniques that separate the desirable (i.e. high-grade) and undesirable (i.e. low-grade or uneconomic) materials and ensure the delivery of only selected quantity of high quality (or high-grade) material to energy, water, and cost-intensive processing plant. The model maximizes the net present value under a range of operational and processing constraints. Given that the proposed model is computationally complex, the authors employ a data pre-processing procedure and then evaluate the performance of the model at several practical instances using computation time, optimality gap, and the net present value as valid measures. In addition, a comparison of the proposed and traditional (without Grade Engineering) models reflects that the proposed model outperforms the traditional formulation.     

新型树启发式搜索算法的机器人路径规划

面对三维空间移动机器人从起始点到终止点的最短路径问题,提出一种新型的边缘点树启发式搜索(TreeEP)算法,该方法将地图空间进行密度可调的三维离散化处理,根据障碍安全距离筛选出障碍物的可靠边缘点信息,再利用树扩散架构选出最能引导搜索方向的潜力点进行扩散搜索,最终得出最短路径。提出局部调整策略,得到改进的Tree-EP算法。实验结果表明,在带障碍复杂地形最短路径搜索应用中,提出的Tree-EP算法与已有方法相比,能找到更短的移动路径。     

Smart work packaging-enabled constraint-free path re-planning for tower crane in prefabricated products assembly process

Lack of constraint-free crane path planning is one of the critical concerns in the dynamic on-site assembly process of prefabrication housing production (PHP). For decades, researchers and practitioners have endeavored to improve both the efficiency and safety of crane path planning from either static environment or re-planning the path when colliding with constraints or periodically updating the path in the dynamic environment. However, there is a lack of approach related to the in-depth exploration of the nature of dynamic constraints so as to assist the crane operators in making adaptive path re-planning decisions by categorizing and prioritizing constraints. To address this issue, this study develops the smart work packaging (SWP)-enabled constraints optimization service. This service embraces the core characteristics of SWP, including adaptivity, sociability, and autonomy to achieve autonomous initial path planning, networked constraints classification, and adaptive decisions on path re-planning. This service is simulated and verified in the BIM environment, and it is found that SWP-enabled constraints optimization service can generate the constraint-free path when it is necessary.     

Perception‐aware autonomous mast motion planning for planetary exploration rovers

Highly accurate real‐time localization is of fundamental importance for the safety and efficiency of planetary rovers exploring the surface of Mars. Mars rover operations rely on vision‐based systems to avoid hazards as well as plan safe routes. However, vision‐based systems operate on the assumption that sufficient visual texture is visible in the scene. This poses a challenge for vision‐based navigation on Mars where regions lacking visual texture are prevalent. To overcome this, we make use of the ability of the rover to actively steer the visual sensor to improve fault tolerance and maximize the perception performance. This paper answers the question of where and when to look by presenting a method for predicting the sensor trajectory that maximizes the localization performance of the rover. This is accomplished by an online assessment of possible trajectories using synthetic, future camera views created from previous observations of the scene. The proposed trajectories are quantified and chosen based on the expected localization performance. In this study, we validate the proposed method in field experiments at the Jet Propulsion Laboratory (JPL) Mars Yard. Furthermore, multiple performance metrics are identified and evaluated for reducing the overall runtime of the algorithm. We show how actively steering the perception system increases the localization accuracy compared with traditional fixed‐sensor configurations.     

Airline planning and scheduling: Models and solution methodologies

The airline industry is a representative industry with high cost and low profitability. Therefore, airlines should carefully plan their schedules to ensure that overall profit is maximized. We review the literature on airline planning and scheduling and focus on mathematical formulations and solution methodologies. Our research framework is anchored on three major problems in the airline scheduling, namely, fleet assignment, aircraft routing, and crew scheduling. General formulation, widely used solution approaches, and important extensions are presented for each problem and integrated problems. We conclude the review by identifying promising areas for further research.     

计及时间相关性的微能源网鲁棒规划方法

微能源网以能源的梯级利用为原则,可实现风、光等多种新能源的高比例消纳,满足区域内电、热、冷等多种能源需求。微能源网中存在新能源出力与冷、热、电负荷的多重不确定性。为增强系统规划结果的鲁棒性,常采用不确定集表述新能源出力与多种用能需求的不确定性,实现针对微能源网的鲁棒规划设计,往往使系统规划结果过于保守,降低系统经济性。为克服以上问题,规避实际运行中不可能发生的场景,降低系统规划结果的保守性,文章提出一种考虑时间相关性的微能源网鲁棒规划模型。该模型在计及多重源荷不确定性的基础上,进一步考虑新能源出力与冷、热、电负荷的时间相关性。通过算例对传统不确定集与所提出的改进不确定集进行对比分析,验证了所提模型及方法的优越性和有效性。     

地下矿用车辆无人驾驶目标路径规划方法研究

针对井下巷道复杂多变的路面条件,将地下矿用车辆无人驾驶目标路径划分为主目标路径和局部避障目标路径,在主目标路径规划时不必考虑局部避障问题,在主目标路径规划完成后,再进行局部避障目标路径规划。建立车辆轨迹跟踪偏差控制模型及动力转向控制模型,通过对模型的仿真计算,可对地下矿用车辆无人驾驶目标路径进行规划及优化。该目标路径规划方法具有简单方便和灵活可靠的优点。     

Replenishment policy for a purchase-to-order seller: a tradeoff between ordering cost and delay cost

We consider replenishment decisions on when and how many goods to purchase for a seller under a purchase-to-order mode where there is no inventory and the seller purchases goods to fulfil orders already placed. For each purchase, there is a constant ordering cost. For each order, delay cost will be incurred if it is not fulfilled timely. Generally, the more frequent the replenishment, the higher the ordering cost but the lower the delay cost. Consequently, there is a tradeoff between the ordering cost and the delay cost for the seller to make replenishment decisions minimising the total cost. In this paper, we study three cases of the problem and investigate both offline versions and online versions according to the seller's knowledge about information of future orders. For offline versions with perfect information, we either develop an optimal policy, or prove it is NP-hard and develop an approximation policy. For online versions without any information about future orders, from the perspective of competitive analysis we prove the lower bound of competitive ratio for any possible online policy and present a 10-competitive online policy for the general case and a 2-competitive online policy for each of two special cases.