Exploring the Potential of LLM-based Chatbots for Task Scheduling in Robot Operations
Catarina Rema, Armando Sousa, Héber Sobreira, Manuel F. Silva
- 发表年份
- 2025
- 引用次数
- 1
摘要
The rise of Industry 4.0 has revolutionized manufacturing by integrating real-time data analysis, artificial intelligence (AI), automation, and interconnected systems, enabling adaptive and resilient smart factories. Autonomous Mobile Robots (AMRs), with their advanced mobility and navigation capabilities, are a pillar of this transformation. However, their deployment in job shop environments adds complexity to the already challenging Job Shop Scheduling Problem (JSSP), expanding it to include task allocation, robot scheduling, and travel time optimization, creating a multi-faceted, non-deterministic polynomial-time hardness (NP-hard) problem. Traditional approaches such as heuristics, meta-heuristics, and mixed integer linear programming (MILP) are commonly used. Recent AI advancements, particularly large language models (LLM), have shown potential in addressing these scheduling challenges due to significant improvements in reasoning and decision-making from textual data. This paper examines the application of LLM to tackle scheduling complexities in smart job shops with mobile robots. Guided by tailored prompts inserted manually, LLM are employed to generate scheduling solutions, being these compared to an heuristic-based method. The results indicate that LLM currently have limitations in solving complex combinatorial problems, such as task scheduling with mobile robots. Due to issues with consistency and repeatability, they are not yet reliable enough for practical implementation in industrial environments. However, they offer a promising foundation for augmenting traditional approaches in the future.
关键词
相关论文
Statistical Learning Theory
Yuhai Wu, Vladimir Vapnik
1999
Artificial intelligence: a modern approach
1995
Fractional Differential Equations
Igor Podlubný
2025
Applied Nonlinear Control
Jean-Jacques Slotine, Weiping Li
1991