Keyong Li
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Keyong Li has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- Ioannis Ch. Paschalidis
Department of Electrical and Computer Engineering, Division of Systems Engineering, Boston University, Boston, USA
2 shared publications - Raffaello D'Andrea
Institute for Dynamic Systems and Control, Dept. of Mechanical and Process Engineering, ETH Zürich, Zürich, Switzerland
2 shared publications Dong Guo
Center for Information & Systems Eng., Dept. of Electrical & Computer Eng., and Division of Systems Eng., Boston University, Boston
1 shared publication- Jiming Chen
Zhejiang University, Hangzhou, China
1 shared publication - Kejie Cao
Zhejiang University
1 shared publication Reza Moazzez Estanjini
Center for Information & Systems Eng., Dept. of Electrical & Computer Eng., and Division of Systems Eng., Boston University, Boston
1 shared publication
Latest Publications
- 22 July 2011
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Informatics
- Vol. 7 (3) , 476-486
Optimizing Warehouse Forklift Dispatching Using a Sensor Network and Stochastic Learning
The authors report on a successful deployment of an inexpensive mobile wireless sensor network in a commercial warehouse served by a fleet of forklifts. The aim is to improve forklift dispatching and reduce the costs associated with the delays of loading/unloading delivery trucks. To that end, an integrated system including both hardware and software is constructed. First, the forklifts are instrumented with sensor nodes that collect an array of information, including the forklifts' physical location, usage time, bumping/collision history, and battery status. The hardware's capability is enhanced with a theoretically sound hypothesis testing technique to capture the rather elusive location information, and the collection of the data is done in an efficient event-driven manner. The information acquired combined with inventory information is fed into a sophisticated actor-critic type stochastic learning method to generate dispatching recommendations. Because noise is inevitable in such wireless sensor networks, the performance of the algorithm is investigated under different noise levels. In combining wireless sensing with state-of-the-art decision theory, this work extends beyond the standard use of wireless sensor networks as monitoring devices.
- 22 July 2011
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Informatics
- Vol. 7 (3) , 476-486
Optimizing Warehouse Forklift Dispatching Using a Sensor Network and Stochastic Learning
The authors report on a successful deployment of an inexpensive mobile wireless sensor network in a commercial warehouse served by a fleet of forklifts. The aim is to improve forklift dispatching and reduce the costs associated with the delays of loading/unloading delivery trucks. To that end, an integrated system including both hardware and software is constructed. First, the forklifts are instrumented with sensor nodes that collect an array of information, including the forklifts' physical location, usage time, bumping/collision history, and battery status. The hardware's capability is enhanced with a theoretically sound hypothesis testing technique to capture the rather elusive location information, and the collection of the data is done in an efficient event-driven manner. The information acquired combined with inventory information is fed into a sophisticated actor-critic type stochastic learning method to generate dispatching recommendations. Because noise is inevitable in such wireless sensor networks, the performance of the algorithm is investigated under different noise levels. In combining wireless sensing with state-of-the-art decision theory, this work extends beyond the standard use of wireless sensor networks as monitoring devices.
- 4 June 2009
- Published by Springer Nature in Cluster Computing
- Vol. 14 (1) , 55-64
Distributed sensor activation algorithm for target tracking with binary sensor networks
- 4 June 2009
- Published by Springer Nature in Cluster Computing
- Vol. 14 (1) , 55-64
Distributed sensor activation algorithm for target tracking with binary sensor networks
- 1 January 2008
- Published by Elsevier in IFAC Proceedings Volumes
- Vol. 41 (2) , 10069-10074
Distribution-Dependent Robust Linear Optimization with Asymmetric Uncertainty and Application to Optimal Control
- 1 January 2008
- Published by Elsevier in IFAC Proceedings Volumes
- Vol. 41 (2) , 10069-10074
Distribution-Dependent Robust Linear Optimization with Asymmetric Uncertainty and Application to Optimal Control
- 3 December 2007
- Published by Elsevier in Robotics and Autonomous Systems
- Vol. 56 (8) , 658-669
Motion design and learning of autonomous robots based on primitives and heuristic cost-to-go
- 3 December 2007
- Published by Elsevier in Robotics and Autonomous Systems
- Vol. 56 (8) , 658-669
Motion design and learning of autonomous robots based on primitives and heuristic cost-to-go
- 1 December 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 3345-3350
Trajectory Design of Autonomous Vehicles Based on Motion Primitives and Heuristic Cost-to-Go Functions
The task of trajectory design of autonomous vehicles is typically two-fold. First, it needs to take into account the intrinsic dynamics of the vehicle, which are sometimes termed local constraints. Second, on a higher level, the designed trajectories must allow the vehicle to achieve some application-specific task. The specification of the task results in the so-called global constraints. Both of these two components of trajectory design are generally nontrivial problems, and very often, they are pursued as two parallel areas. When the results drawn from the two areas are applied in conjunction, the synthesis is usually somewhat arbitrary. In this paper, we assume some optimal control strategy that addresses the vehicle dynamics is available as a set of motion primitives. The trajectories that achieve the task are determined solely through the primitives and do not reference the vehicle dynamics directly. For the higher level, we translate the task into a very special type of cost-to-go function, which is partially specified artificially, and partially determined by an admissibility condition imposed by the set of primitives. The optimality feature of the primitives is formally extended to the final trajectory design. We illustrate our result with the example of a mobile robot retrieving an object, which is an interesting problem of its own right. In this case, the cost-to-go function for the task is specified arbitrarily for all vehicle positions and zero velocity, and determined automatically elsewhere in the position-velocity space
- 1 December 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 3345-3350
Trajectory Design of Autonomous Vehicles Based on Motion Primitives and Heuristic Cost-to-Go Functions
The task of trajectory design of autonomous vehicles is typically two-fold. First, it needs to take into account the intrinsic dynamics of the vehicle, which are sometimes termed local constraints. Second, on a higher level, the designed trajectories must allow the vehicle to achieve some application-specific task. The specification of the task results in the so-called global constraints. Both of these two components of trajectory design are generally nontrivial problems, and very often, they are pursued as two parallel areas. When the results drawn from the two areas are applied in conjunction, the synthesis is usually somewhat arbitrary. In this paper, we assume some optimal control strategy that addresses the vehicle dynamics is available as a set of motion primitives. The trajectories that achieve the task are determined solely through the primitives and do not reference the vehicle dynamics directly. For the higher level, we translate the task into a very special type of cost-to-go function, which is partially specified artificially, and partially determined by an admissibility condition imposed by the set of primitives. The optimality feature of the primitives is formally extended to the final trajectory design. We illustrate our result with the example of a mobile robot retrieving an object, which is an interesting problem of its own right. In this case, the cost-to-go function for the task is specified arbitrarily for all vehicle positions and zero velocity, and determined automatically elsewhere in the position-velocity space