- Advanced Manufacturing and Logistics Optimization
- Robotic Path Planning Algorithms
- Scheduling and Optimization Algorithms
- Robot Manipulation and Learning
- Optimization and Packing Problems
- Optimization and Search Problems
- Robotic Mechanisms and Dynamics
- Prosthetics and Rehabilitation Robotics
- AI-based Problem Solving and Planning
- Flexible and Reconfigurable Manufacturing Systems
- Muscle activation and electromyography studies
- Advanced Queuing Theory Analysis
- Petri Nets in System Modeling
- Modular Robots and Swarm Intelligence
- Smart Parking Systems Research
- Teleoperation and Haptic Systems
- Real-Time Systems Scheduling
- Vehicle Routing Optimization Methods
- Elevator Systems and Control
- Manufacturing Process and Optimization
- Urban and Freight Transport Logistics
- Assembly Line Balancing Optimization
University of the Philippines Mindanao
2020
The University of Tokyo
2005-2019
Purpose This paper aims to develop a scheduler for multiple picking agents in warehouse that takes into account distance and loading queue delay minimization within the context of minimizing makespan (i.e. time). Design/methodology/approach The uses tabu search solve scheduling problem more global sense. Each iteration is enhanced by custom local (LS) procedure hastens convergence driving given schedule configuration quickly minimum. In particular, basic operators transfer demand among...
Analyzing throughput is very important for the design, optimization, and management of production lines. In this paper, we present an efficient analysis approach lines with merging, splitting, recirculating topologies. particular, define a decomposition regulation based on queue modules various topologies, improve iterative approximation method calculating iterating module state probabilities until line obtained. To decrease computation time automate calculation process probabilities, build...
In this paper, the final stage of a multiphase approach for solving picking problem in warehouse is addressed. Given number agents, each with its own set sequences (trips or routes) to accomplish, dispatching described and shown have non-polynomial search space respect agents routes. A simulation-based scheduling procedure proposed solve problem. The aim reduce potential delays induced by agent queues. Extensive statistical simulations on realistic operating at varying conditions are...
In Shop Scheduling problems, minimising total processing time (makespan) by means of heuristic methods is one the main goals for throughput optimisation. Furthermore, reliably estimating makespan critical new order acceptance and method selection. However, solutions either come without estimates or with very slow ones. Current estimation approaches are limited to number accounted for, specific subproblems. They especially in generalising over shop layout configurations non-visual data input....
In this paper, fast heuristics for a centralized multi-agent route planner are presented and computationally evaluated. We solve sub-problem of warehouse scheduling involving the routing intelligent agents as preliminary step in optimizing total schedule. The problem involves generation routes automated tasked with transfer items within from storage pallets to common loading shed. goal is minimize distance number generated. This constitutes multiple-objective optimization which NP-hard hence...
This study addresses the challenging problem of efficient buffer allocation in production lines. Suitable locations for are determined to satisfy desired throughput, while a suitable balance between solution quality and computation time is achieved. A throughput calculation approach that yields state probability lines adopted evaluate effectiveness candidate solutions. To generate solutions, an active index based on proposed rapidly detect allocations. variable neighborhood search algorithm...
In Shop Scheduling problems, reliably estimating makespan is critical for new order acceptance and efficient scheduling. However, methods the are either slow, not accurate, and/or limited to a specific subproblem. We propose MultiLayer Perceptron type Neural Network Machine Learning (ML) algorithm quick accurate prediction, applicable wide variety of Problems. A big data training set acquired. Furthermore, novel, information preserving mapping made from problem parameters ML input features....
Distribution centers, which are essential to our society, becoming increasingly important. Although the efficiency of an AVS/RS (Autonomous vehicle storage and retrieval system) makes it a promising system, there is still much be studied regarding its effective use design. This paper proposes method designing AVS/RSs through quantitative consideration group constraint by utilizing probability theory. The proposed algorithm also deals with problem sizes several buffers, considers effect load...
[abstFig src='/00290002/14.jpg' width='300' text='Two robots performing the task of opening folding chair lying on floor' ] In this study, we present a novel framework to address problem teaching manipulation tasks performed by single human set multiple small in short period. First, focused classifying style used during human-performed task. An allocator process is proposed determine type and number be taught based capabilities available robots. Then, according detected requirements, robot...
This paper aims to design a compact manipulator system consisting of 6 degree-of-freedom (dof) and 1-dof rotary table. It proposes new compactness measure that considers swept volume or the space occupied by while executing task. Swept is crucial because has small footprint but can occupy substantial due its large workspace. Moreover, since negatively impact motion, problem formulated with motion time temporal constraint. A best-effort search method proposed minimize reduce level constraint...
A major goal in scheduling multiagent for warehouse picking is to decrease operating cost by minimizing makespan among transport agents. Computational time must be within ten seconds real-sized instances. Orders are initially batched solving the split delivery vehicle routing problem, resulting trips assigned agents balance their time, and minimize blocking delays Simulation results confirmed that our proposal reduces an average of 11.48% over conventional approaches.
A method for modifying robot behaviors is introduced to improve performance during the execution of object manipulation tasks. The purpose this minimize time tasks and prevent collision with obstacles, including objects be manipulated itself, by considering two approaches. first use potential that robots can provide, programs are based on events subject response sensors. second determine maximum rate at which commands sent, without affecting responses from sensors, and, that, accelerate or...
The main function of robots is to assist humans with tasks. We can find successful examples in factories and hospitals. Yet, service mobile robots, designed help houses, are still its early stages. current state robotics inspired me start my research this field. First, during Master thesis I developed a semi-direct teaching method for robots. conveys human knowledge on how grasp objects through the use tool. evaluated by parallel gripper. system met proposed targets, yet, results showed that...
The main function of robots is to assist humans with tasks. We can find successful examples in factories and hospitals. Yet, service mobile robots, designed help houses, are still its early stages. current state robotics inspired me start my research this field. First, during Master thesis I developed a semi-direct teaching method for robots. conveys human knowledge on how grasp objects through the use tool. evaluated by parallel gripper. system met proposed targets, yet, results showed that...