Back to results

University of Illinois at Urbana-Champaign

Geometric planning for VLSI routing and robot motion

Abstract

dc:description

This thesis proposes a decomposition-based algorithmic paradigm, called planning with local experts, where the given global planning problem is decomposed into a set of subproblems that are each solved efficiently in a prescribed sequence and then the solutions of the subproblems are merged together.

Degree

thesis:*
Name thesis:degree_name
Ph.D.
Level thesis:degree_level
Dissertation
Discipline thesis:degree_discipline
Electrical and Computer Engineering
Grantor
University of Illinois at Urbana-Champaign
Year dc:date
2011

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Maddila, Sanjeev Rao

Subjects

dc:subject × 3

Rights

dc:rights
Statement dc:rights
  • Copyright 1989 Maddila, Sanjeev Rao
Language dc:language
eng

Identifiers

dc:identifier.*
Identifier
AAI9010946
(UMI)AAI9010946
OAI identifier oai:identifier
oai:www.ideals.illinois.edu:2142/22372

Chain of custody

source
Harvested from
University of Illinois - Urbana-Champaign
Base URL
www.ideals.illinois.edu/oai-pmh
Last updated
2026-07-22
Source record
OAI-PMH GetRecord
citation

Maddila, Sanjeev Rao. Geometric planning for VLSI routing and robot motion. Dissertation thesis, University of Illinois at Urbana-Champaign, 2011. http://hdl.handle.net/2142/22372