SearcharxivSearch

arXiv subjects

Jingchuan Chen

Publications and source records attributed to Jingchuan Chen.

2 recordsLinked to original sources

Machine Learning for Scheduling Decision Systems: A Critical Review of Architecture, Assurance, and Deployment

Machine learning supports scheduling through prediction, search guidance, or schedule formation, but model-level evaluations obscure the downstream work, technical authority, and controls needed to release decisions. We conduct a critical integrative review combining structured candidate identification and purposive full-text synthesis, treating the complete reported scheduling decision system (from problem specification to release and conditional recovery) as the unit of analysis. Our system-level taxonomy distinguishes the function of learned outputs, schedule formation, and binding control along the normal release path. It separates learning and adaptation from decision assurance, and technical authority from organizational decision rights. Reported timing and solver guarantees depend on downstream work and the decision space left after learned commitments; transfer of retained capability differs from architectural reuse, and operational maturity from automated release. Evidence supports selected quality-computation-time trade-offs, bounded transfer of retained capability, performance within specified regimes, and operating use in several configurations. It does not support a system-equivalent ranking of learning and optimization, general cross-task transfer, or common conclusions about lifecycle economics and long-run field performance. Four operations-management propositions link lifecycle value to effective reuse, technical authority to forms of change, deadline-feasible assurance and recovery, and organizational rights to information and accountability. Solver-led, shared-authority, and model-led configurations are alternative designs, not maturity stages; model performance alone does not justify greater release authority.

math.OC

Path Planning Considering Time-Varying and Uncertain Movement Speed in Multi-Robot Automatic Warehouses: Problem Formulation and Algorithm

Path planning in the multi-robot system refers to calculating a set of actions for each robot, which will move each robot to its goal without conflicting with other robots. Lately, the research topic has received significant attention for its extensive applications, such as airport ground, drone swarms, and automatic warehouses. Despite these available research results, most of the existing investigations are concerned with the cases of robots with a fixed movement speed without considering uncertainty. Therefore, in this work, we study the problem of path-planning in the multi-robot automatic warehouse context, which considers the time-varying and uncertain robots' movement speed. Specifically, the path-planning module searches a path with as few conflicts as possible for a single agent by calculating traffic cost based on customarily distributed conflict probability and combining it with the classic A* algorithm. However, this probability-based method cannot eliminate all conflicts, and speed's uncertainty will constantly cause new conflicts. As a supplement, we propose the other two modules. The conflict detection and re-planning module chooses objects requiring re-planning paths from the agents involved in different types of conflicts periodically by our designed rules. Also, at each step, the scheduling module fills up the agent's preserved queue and decides who has a higher priority when the same element is assigned to two agents simultaneously. Finally, we compare the proposed algorithm with other algorithms from academia and industry, and the results show that the proposed method is validated as the best performance.

cs.RO