Author name cluster

Sejoon Lim

Possible papers associated with this exact author name in Arrow. This page groups case-insensitive exact name matches and is not a full identity disambiguation profile.

3 papers

1 author row

ICRA Conference 2012 Conference Paper

Stochastic distributed multi-agent planning and applications to traffic

Sejoon Lim
Daniela Rus

This paper proposes a method for multi-agent path planning on a road network in the presence of congestion. We suggest a distributed method to find paths for multiple agents by introducing a probabilistic path choice achieving global goals such as the social optimum. This approach, which shows that the global goals can be achieved by local processing using only local information, can be parallelized and sped-up using massive parallel processing. The probabilistic assignment reliably copes with the case of random choices of unidentified agents or random route changes of agents who ignore our path guidance. We provide the analytical result on convergence and running time. We demonstrate and evaluate our algorithm by an implementation using asynchronous computation on multi-core computers.

Details

ICRA Conference 2012 Conference Paper

Stochastic motion planning with path constraints and application to optimal agent, resource, and route planning

Sejoon Lim
Daniela Rus

We present algorithms for a motion planning for multiple agents whose goals are to visit multiple locations with probabilistic guarantees for achieving the goal. Though much research has been done in stochastic shortest path algorithms, the existing algorithms focus on the single-origin single-destination problem for one agent. This paper formulates a general framework for the stochastic shortest path problem with visit node constraints designed to achieve a specific goal with multiple agents, multiple resources, and multiple destinations. The constraints are defined by a set of sequences of nodes to be visited. Given predetermined constraints, our motion planning problem consists of finding the best agents, resources, and destinations, and the path through a sequence of nodes representing them. The technique in this paper solves the problem at the same level of complexity as solving the single-origin single-destination problem by parallelization. We demonstrate the algorithm by a Web-based traffic navigation guide system and evaluate the algorithm's performance.

Details

IROS Conference 2009 Conference Paper

Fast shadow detection for urban autonomous driving applications

Sooho Park
Sejoon Lim

This paper presents shadow detection methods for vision-based autonomous driving in an urban environment. Shadows misclassified as objects create problems in autonomous driving applications. Real-time efficient algorithms in dynamic background settings are proposed. Without the static background assumption, which was often used in previous work to develop fast algorithms, our scheme estimates the varying background efficiently. A combination of various features classifies each pixel into one of the following categories: road, shadow, dark object, or other objects. In addition to pixel level classification, spatial context is also used to identify the shadows. Our results show that our methods perform well for autonomous driving applications and are fast enough to work in real time.

Details