Changjoo Nam

ORCID: 0000-0002-9169-0785
Publications
Citations
Views
---
Saved
---
About
Contact & Profiles
Research Areas
  • Robotic Path Planning Algorithms
  • Robotics and Sensor-Based Localization
  • Optimization and Search Problems
  • Robot Manipulation and Learning
  • Distributed Control Multi-Agent Systems
  • Modular Robots and Swarm Intelligence
  • Reinforcement Learning in Robotics
  • 3D Surveying and Cultural Heritage
  • Social Robot Interaction and HRI
  • Advanced Manufacturing and Logistics Optimization
  • Indoor and Outdoor Localization Technologies
  • Robotics and Automated Systems
  • Robotic Mechanisms and Dynamics
  • Scheduling and Optimization Algorithms
  • AI-based Problem Solving and Planning
  • Machine Learning and Algorithms
  • Control and Dynamics of Mobile Robots
  • Auction Theory and Applications
  • Artificial Intelligence in Games
  • Advanced Bandit Algorithms Research
  • Innovations in Concrete and Construction Materials
  • Mobile Crowdsensing and Crowdsourcing
  • Computational Geometry and Mesh Generation
  • Gaze Tracking and Assistive Technology
  • AI in Service Interactions

Sogang University
2022-2023

Korea Institute of Science and Technology
2010-2021

Inha University
2021

Carnegie Mellon University
2017-2019

Texas A&M University
2014-2016

Korea University
2009-2010

In this paper, we study human trust and its computational models in supervisory control of swarm robots with varied levels autonomy (LOA) a target foraging task. We implement three LOAs: manual, mixed-initiative (MI), fully autonomous LOA. While the MI LOA is controlled by operator an search algorithm collaboratively, swarms manual LOAs are directed algorithm, respectively. From user studies, find that humans tend to make their decisions based on physical characteristics rather than...

10.1109/thms.2019.2896845 article EN IEEE Transactions on Human-Machine Systems 2019-02-25

We present an algorithm that produces a plan for relocating obstacles in order to grasp target clutter by robotic manipulator without collisions. consider configurations where objects are densely populated constrained and confined space. Thus, there exists no collision-free path the obstacles. Since problem of planning object rearrangement has shown be NP-hard, it is difficult perform manipulation tasks efficiently which could frequently happen service domains (e.g., taking out from shelf or...

10.1109/icra.2019.8793616 article EN 2022 International Conference on Robotics and Automation (ICRA) 2019-05-01

This paper presents a task and motion planning (TAMP) framework for robotic manipulator in order to retrieve target object from clutter. We consider configuration of objects confined space with high density so no collision-free path the exists. The robot must relocate some without collisions. For fast completion rearrangement, aims optimize number pick-and-place actions which often determines efficiency TAMP framework.We propose planner incorporating generate executable plans minimize...

10.1109/icra40945.2020.9196652 article EN 2020-05-01

We present an algorithm determining where to relocate objects inside a cluttered and confined space while rearranging retrieve target object. Although methods that decide what remove have been proposed, planning for the placement of removed workspace has not received much attention. Rather, are often placed outside workspace, which incurs additional laborious work (e.g., motion execution manipulator mobile base, perception other areas). Some manipulate only but without principle so...

10.1109/icra40945.2020.9197485 article EN 2020-05-01

This paper considers multirobot task allocation problems where the estimated costs for performing tasks are interrelated, and overall team objective need not be a standard sum-of-costs (or utilities) model, enabling straightforward treatment of additional incurred by resource contention. In model we introduce, may choose one set shared resources to perform (e.g., several routes reach destination), interference is modeled when multiple robots use same resource. We show that general problem...

10.1109/tase.2015.2415514 article EN IEEE Transactions on Automation Science and Engineering 2015-04-15

We consider multi-robot teams operating in uncertain dynamic settings where the costs used for computing task-allocations are not known exactly. In such cases, desire to minimize team's expected cost might need be curtailed if, doing so, risk that results is intolerable. describe a parameterizable variant of assignment problem enables designer express preferences, allowing one take risk-averse position if demands it. random variables, but which independent—a useful setting because it permits...

10.1109/lra.2016.2588138 article EN IEEE Robotics and Automation Letters 2016-01-01

We address the problem of finding optimal assignment tasks to a team robots when associated costs may vary, which arises deal with uncertain or dynamic situations. detail how compute sensitivity analysis that characterizes much change before optimality is violated. Using this analysis, are able avoid unnecessary re-assignment computations and reduce global communication. First, given model evolve, we develop an algorithm partition into independent cliques, each maintains by communicating...

10.1109/icra.2015.7139351 article EN 2015-05-01

We consider the problem of retrieving a target object from confined space by two robotic manipulators where overhand grasps are not allowed. If other movable obstacles occlude target, more than one should be relocated to clear path reach object. With robots, relocation could done efficiently simultaneously performing tasks. However, precedence constraint between tasks (e.g, some objects at front removed manipulate in back) makes simultaneous task execution difficult. propose coordination...

10.1109/icra46639.2022.9811978 article EN 2022 International Conference on Robotics and Automation (ICRA) 2022-05-23

We consider optimization of the multi-robot task-allocation problem when overall performance team need not be a standard sum-of-cost model. introduce generalization that allows for additional cost incurred by resource contention to treated in straightforward manner. In this variant, robots may choose one shared resources perform task, and interference modeled as occurring multiple use same resource. investigate general NP-hard instances where results linear or convex penalization functions....

10.1109/icra.2014.6907156 article EN 2014-05-01

In this paper, we study the model of human trust where an operator controls a robotic swarm remotely for search mission. Existing models in human-in-the-loop systems are based on task performance robots. However, find that humans tend to make their decisions physical characteristics rather than its since swarms is not clearly perceivable by humans. We formulate as Markov decision process whose state space includes parameters swarm. employ inverse reinforcement learning algorithm learn...

10.1109/roman.2017.8172353 article EN 2017-08-01

In this article, we present a task and motion planning method for retrieving target object from clutter using robotic manipulator. We consider dense cluttered environments where some objects must be removed in order to retrieve the without collisions. To ensure successful execution, interplay between ( <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">what remove what order</i> ) xmlns:xlink="http://www.w3.org/1999/xlink">how remove</i> is...

10.1109/tro.2020.3047472 article EN IEEE Transactions on Robotics 2021-01-21

In this paper, we propose an algorithmic compass that yields the heading information of a mobile robot using vanishing point in indoor environments: VPass. With VPass, loop-closing effect (which is significant reduction errors by revisiting known place through loop) can be achieved even for loop-less environment. From implementation view, VPass useful because it appended upon any existing navigation algorithms. Experimental results show accurate angle environments paths with lengths around 200 m.

10.1109/iros.2009.5354508 article EN 2011 IEEE/RSJ International Conference on Intelligent Robots and Systems 2009-10-01

In this paper, we study trust-related human factors in supervisory control of swarm robots with varied levels autonomy (LOA) a target foraging task. We compare three LOAs: manual, mixed-initiative (MI), and fully autonomous LOA. the manual LOA, operator chooses headings for flocking swarm, issuing new as needed. is redirected automatically by changing using search algorithm. if performance declines, switched from to or human. The result work extends current knowledge on control....

10.1109/smc.2018.00148 article EN 2022 IEEE International Conference on Systems, Man, and Cybernetics (SMC) 2018-10-01

This paper presents a software architecture for robots providing manipulation services autonomously in human environments. In an unstructured environment, service robot often needs to perform tasks even without intervention and prior knowledge about For autonomous execution of tasks, varied processes are necessary such as perceiving environments, representing knowledge, reasoning with the planning task motion. While developing each is important, integrating them into working system...

10.1109/access.2020.3003991 article EN cc-by IEEE Access 2020-01-01

We propose a tree search-based planning algorithm for robot manipulator to rearrange objects and grasp target in dense space. consider environments where tasks cannot be completed with prehensile only. As assuming that is only allowed from the top, we aim minimize number of rearrangement actions total execution time, which affects efficiency manipulation. The proposed search determines optimal sequence object non-prehensile grasping until target. For grasping, heuristic function employed...

10.1109/icra48506.2021.9561895 article EN 2021-05-30

Abstract In the case of a visually impaired person, literal communication often relies on braille, system predominantly dependent vision and touch. This study entailed development visual tactile perception technique for braille character recognition. approach, recognition was performed using deep learning model (Faster R-CNN–FPN–ResNet-50), based custom-made dataset collected through data augmentation preprocessing. The attained performance indicated by an mAP50 94.8 mAP75 70.4 generated...

10.1186/s40486-023-00191-w article EN cc-by Micro and Nano Systems Letters 2023-12-14

This paper presents planning algorithms for a robotic manipulator with fixed base in order to grasp target object cluttered environments. We consider configuration of objects confined space high density so no collision-free path the exists. The robot must relocate some retrieve while avoiding collisions. For fast completion retrieval task, needs compute plan optimizing an appropriate objective value directly related execution time relocation plan. propose that aim minimize number be...

10.48550/arxiv.1907.03956 preprint EN other-oa arXiv (Cornell University) 2019-01-01

In this article, we study multirobot task allocation problems where costs vary. The variation may be, for example, due to the revelation of new information or other dynamic circumstances. As robots update their cost estimates, typically they will assignments reflect using additional communication and computation. settings, are continually repairing optimality system's assignments, which can incur substantial We investigate how one reduce centralized computation expense during execution by a...

10.1109/tro.2019.2937468 article EN publisher-specific-oa IEEE Transactions on Robotics 2019-09-18

In this paper, we consider the problem of Multi-Robot Path Planning (MRPP) in continuous space to find conflict-free paths. The difficulty arises from two primary factors. First, involvement multiple robots leads combinatorial decision-making, which escalates search exponentially. Second, presents potentially infinite states and actions. For problem, propose a two-level approach where low level is sampling-based planner Safe Interval RRT* (SI-RRT*) that finds collision-free trajectory for...

10.48550/arxiv.2404.01752 preprint EN arXiv (Cornell University) 2024-04-02

We consider the problem of rearranging objects in a cluttered and confined space using robotic manipulator. The goal is to retrieve target object from clutter where occluded by other objects. In situations overhand grasps are not allowed, robot needs remove some make accessible. course removing objects, also determine locations place removed If can access enough empty spaces around or inside clutter, placement trivially simple. scarce, placing should be done principled way as an incorrect...

10.1109/icra48506.2021.9561282 article EN 2021-05-30

Development of Robotic-Crane Based Automatic Construction System for Steel Structures High-Rise Buildings Tae-Koo Kang, Changjoo Nam, Ung-Kyun Lee, Nakju Lett Doh, Gwi-Tae Park Pages 670-671 (2011 Proceedings the 28th ISARC, Seoul, Korea, ISBN 978-89-954572-4-5, ISSN 2413-5844) Abstract: In this paper, we address a new technique automatic construction steel structure in high-rise buildings termed RCA system (Robotics & Crane based Automated System). can be divided into four core systems: 1)...

10.22260/isarc2011/0125 article EN Proceedings of the ... ISARC 2011-06-29
Coming Soon ...