KGKamal Gupta

Kamal Gupta

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Kamal Gupta has a total of 19 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Metamodel-Based Optimization for Problems With Expensive Objective and Constraint Functions

    by Moslem Kazemi, G. Gary Wang, Shahryar Rahnamayan, Kamal Gupta

    Current metamodel-based design optimization methods rarely deal with problems of not only expensive objective functions but also expensive constraints. In this work, we propose a novel metamodel-based optimization method, which aims directly at reducing the number of evaluations for both objective function and constraints. The proposed method builds on existing mode pursuing sampling method and incorporates two intriguing strategies: (1) generating more sample points in the neighborhood of the promising regions, and (2) biasing the generation of sample points toward feasible regions determined by the constraints. The former is attained by a discriminative sampling strategy, which systematically generates more sample points in the neighborhood of the promising regions while statistically covering the entire space, and the latter is fulfilled by utilizing the information adaptively obtained about the constraints. As verified through a number of test benchmarks and design problems, the above two coupled strategies result in significantly low number of objective function evaluations and constraint checks and demonstrate superior performance compared with similar methods in the literature. To the best of our knowledge, this is the first metamodel-based global optimization method, which directly aims at reducing the number of evaluations for both objective function and constraints.


  • Path-Planning for Visual Servoing: A Review and Issues

    by Moslem Kazemi, Kamal Gupta, Mehran Mehrandezh


  • View Planning Problem with Combined View and Traveling Cost

    by Pengpeng Wang, Ramesh Krishnamurti, Kamal Gupta

    In this paper, we introduce the problem of view planning with combined view and traveling cost, denoted by traveling VPP. It refers to planning a sequence of sensing actions with minimum total cost by a robot-sensor system to completely inspect the surfaces of objects in a known workspace. The cost to minimize is a combination of the view cost, proportional to the number of viewpoints planned, and the traveling cost for the robot to realize them. First, we formulate traveling VPP as an integer linear program (ILP). The focus of this paper is to design an approximation algorithm that guarantees worst-case performance (w.r.t. the optimal solution cost). We propose a linear program based rounding algorithm that achieves an approximation ratio of the order of view frequency, defined to be the maximum number of viewpoints that see a single surface patch of the object. Together with the result we showed (2006), the best approximation ratio for Traveling VPP is either the order of view frequency or a poly-log function of the input size, whichever is smaller. Motivated from the robot motion planning techniques, where the graph built for robot traveling is a tree, we then consider the corresponding special case of traveling VPP, and give a polynomial sized LP formulation. We conclude with a discussion of realistic issues and constraints towards implementing our algorithm on real robot-sensor systems.


  • Metric View Planning Problem with Traveling Cost and Visibility Range

    by Pengpeng Wang, Ramesh Krishnamurti, Kamal Gupta

    In this paper, we consider the problem where a point robot in a 2D or 3D environment equipped with an omnidirectional range sensor of finite range D is asked to inspect a set of surface patches, while minimizing the sum of view cost, proportional to the number of viewpoints planned, and the travel cost, proportional to the length of path traveled. We call it the metric view planning problem with traveling cost and visibility range or metric TVPP in short. Via an L-reduction from the set covering problem to a two-dimensional metric TVPP, we show that the metric TVPP cannot be approximated within O(log m) ratio by any polynomial algorithm, where m is the number of surface patches to cover. We then analyze the natural two-level algorithm, presented by Danner and Kavraki (2002), of solving first the view planning problem to get an approximate solution, and then solving, again using an approximation algorithm, the Metric traveling salesman problem to connect the planned viewpoints. We show this greedy algorithm has the approximation ratio of O(log m). Thus, it asymptotically achieves the best approximation ratio one can hope for.


  • Motion Planning of Multiple Agents in Virtual Environments on Parallel Architectures

    by Yi Li, Kamal Gupta

    We proposed in a previous paper (2006) a hybrid two-layered approach for motion planning of multiple agents in static virtual environments, consisting of open spaces connected by multiple narrow passages. The discrete generalized Voronoi diagram (GVD) of the environment is used to identify narrow passages, and plan the global path of each agent independently of other agents' global paths. As each agent moves along its global path, the agent's path is locally modified using the hybrid technique of combining steering behaviors with Coordination Graphs (CG), where coordination graphs are used for deadlock avoidance in the narrow passages. The planner in the previous paper was single threaded, and it was able to plan the motions of 30 agents moving around in a simple virtual environment with 3 narrow passages. If more agents are moving in a more complex virtual environment (i.e., with more narrow passages), we may not be able to construct and process all the coordination graphs in real-time. In this paper, we parallelize the single threaded planner in a supervisor-worker paradigm with Unix processes who communicate with each other using System V interprocess communication (IPC) mechanism. We show that significant, scalable speedups are obtained by constructing and processing coordination graphs in parallel on a symmetric multiprocessing (SMP) system.


  • A Hybrid Two-layered Approach to Real-Time Motion Planning of Multiple Agents in Virtual Environments

    by Yi Li, Kamal Gupta

    We proposed in a previous paper a hybrid technique, combining local steering behaviors and coordination graphs (CG), that allows real-time motion planning of multiple agents in a narrow passage. This hybrid technique not only avoids deadlocks, but also exhibits other interesting behaviors such as leader following, even though they are not explicitly coded in the algorithm. In this paper, we build upon the earlier result, and propose a two-layered approach to motion planning of multiple agents in virtual environments, consisting of open spaces connected by multiple narrow passages. The discrete generalized Voronoi diagram (GVD) of the static environment is used to identify all narrow passages automatically. The global path of each agent is also planned using the GVD. As each agent moves along its global path, it is locally modified using the hybrid technique combining steering behaviors with coordination graphs. Experimental results show that the resulting planner is able to plan motions of 30 agents in a virtual environment with three narrow passages in real-time, and the pre-processing phase of our approach is extremely fast. Since all planning is done in real-time, the approach allows an agent to change its final destination at runtime


  • A Configuration Space View of View Planning

    by Pengpeng Wang, Kamal Gupta

    For sensor-based robot motion planning, view planning problem refers to planning the next sensing action to further facilitate the motion planning task. In Y. Yu and K. Gupta (2004), C-space entropy was introduced as a measure of knowledge of robot configuration space, or C-space. The robot plans the next sensing action to maximally reduce the expected C-space entropy, also called the maximal expected entropy reduction, or MER criterion. It was shown that MER criterion resulted in much more efficient C-space exploration performance than physical space based view planning criteria, such as to maximize unknown physical volume in each view. From a C-space perspective, MER criterion consists of two important aspects: sensing actions are evaluated in C-space (geometric aspect); these effects are evaluated in an information theoretical sense (stochastic aspect). In this paper, we investigate how much of this better performance is attributable to the paradigmatic shift to evaluating the sensor action in C-space, i.e., the pure geometric component of MER, and how much is attributable to the stochastic aspect of MER. We propose C-space based pure geometric criteria (which are essentially geometric aspect of MER) for view planning and compare them with the MER criterion. We empirically show that a great deal of efficiency is attributable to the pure geometric aspect; however, we also show that the stochastic aspect, despite being based on simple assumptions, result in moderately more efficient C-space exploration over the pure geometric component of MER. We outline explanations for our findings


  • Editorial: Towards practical motion planners

    by Angel P. del Pobil, Kamal K. Gupta, José Mira


  • MPK: An open extensible motion planning kernel

    by Ian Gipson, Kamal Gupta, Michael Greenspan

    The motion planning kernel (MPK) is a software system designed to facilitate development, testing, and comparison of robotic and geometric reasoning algorithms. Examples of such algorithms include automatic path planning, grasping, etc. The system has been designed to be open and extensible, so that new methods can be easily added and compared on the same platform. © 2001 John Wiley & Sons, Inc.