scholarly journals Orientation-Aware Planning for Parallel Task Execution of Omni-Directional Mobile Robot

Author(s):  
Cheng Gong ◽  
Zirui Li ◽  
Xingyu Zhou ◽  
Jiachen Li ◽  
Junhui Zhou ◽  
...  
1999 ◽  
Vol 6 (4) ◽  
pp. 319-330 ◽  
Author(s):  
Kuniaki Kawabata ◽  
Tatsuya Ishikawa ◽  
Teruo Fujii ◽  
Hajime Asama ◽  
Isao Endo

1972 ◽  
Vol C-21 (12) ◽  
pp. 1310-1322 ◽  
Author(s):  
M.J. Gonzalez ◽  
C.V. Ramamoorthy

Author(s):  
Kiwon Sohn ◽  
Jeongkyu Lee ◽  
Kevin Huang

Abstract This paper presents the development of a miniature humanoid platform for various material-handling tasks. Since 2018, three universities in Connecticut (University of Hartford, University of Bridgeport and Trinity College) have made continuous efforts on building and organizing the annual robotics competition which is titled as Humanoid Challenge (HC). While most robotics competitions are concentrating on mobile robot and its navigation, HC focuses on the small-sized bipedal robot platform (miniature humanoid) and its task-execution in human-centered-environments. Inspired from DRC Trials 2013 and Finals 2015, the participants in the competition are asked to complete six different tasks in a mock-up of a disaster. To assist students and teams who are interested in participating in the competition, the authors in three universities share the progresses with both hardware and software components of each teams robot platform through this paper.


Author(s):  
Shaurya Shriyam ◽  
Satyandra K. Gupta

Most complex missions comprise of spatially separated tasks which have to be finished using teams of mobile robots. The main challenges for planning such missions are forming effective coalitions among available robots and assigning them to tasks in such a way that the expected mission completion time is minimized. Our model allows task execution by a fraction of the assigned team even when the rest of the team has not yet arrived at the task location. We also allow tasks to be interrupted and robots of assigned teams to be rescheduled from an unfinished task to another task. We describe five different heuristic algorithms to compute schedules for all robots assigned to the mission. We compare them and analyze the computational performance of the best performing strategy. We also show how to handle uncertainty that may arise during traveling or task execution and then study the effect of varying uncertainty on the minimization of mission completion time.


2019 ◽  
Vol 139 (9) ◽  
pp. 1041-1050
Author(s):  
Hiroyuki Nakagomi ◽  
Yoshihiro Fuse ◽  
Hidehiko Hosaka ◽  
Hironaga Miyamoto ◽  
Takashi Nakamura ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document