Mobile robots are an important branch of service robots, and path planning is an important research part of mobile robots. For complex environments, traditional A* algorithms tend to be more ...

An order batching and sequencing problem in a warehouse is studied in this work. The problem is proved to be an NP-hard problem. A mathematical programming model is formulated to describe it clearly.