Federal grant · project grant (b)
Career: Topological Abstraction for Robot Path Planning -high Degree-of-freedom Robotic Systems Such as Those Involving One or More Flexible Cables, Multi-robot Systems, Robotics Manipulators and Soft Robotic Arms, Are Ubiquitous in Automation Industries, Household Robotics, Medical Robotics, Field Robotics and Social Robots. Cables Can Be Used by Multi-robot Systems to Tug or Transport Large Loads, and Robots Can Use Fixed Tethers for Power Supply or Communication for Long-term Missions in Gps-denied Environments. Multi-agent Systems Need New Innovations for Coordination-free Planning in a Sociopolitical Environment in Which Privacy Concerns Are on the Rise. Articulated Robotic Manipulators Are Used in a Variety of Industrial Applications Such as Automated Manufacturing, as Well as in Minimally Invasive Assisted Laparoscopic Surgery. This Faculty Early Career Development (CAREER) Project Addresses the Fundamental Question of Complexity Reduction for Such Systems With High-dimensional Configuration Spaces Using Techniques of Topological Abstraction With an Aim of Achieving Fast & Efficient Planning. Integrated With the Research Objectives of This Project Are Educational Plans Aimed at Training Current and Future Generation of Engineers & Researchers in the Science and Technologies of Complex Autonomous Systems That Are Increasingly Becoming Part of Our Modern Society. as an Integral Part of the Project, Stem Education Will Be Advanced Through Establishment of a Mentoring Ecosystem Involving Graduate, Undergraduate & K-12 Students. Students From Underrepresented Groups Will Be Involved in the Research Activities With an Aim of Developing a Comprehensive & Scalable Education Program. in This Project Novel Theoretical and Algorithmic Tools Will Be Developed for Achieving Topological Abstraction of High-dimensional Configuration Spaces With an Aim of Allowing Efficient Optimal Path Planning for High Degree-of-freedom Systems Using Topological Path Planning Methods. Homotopy Invariants Will Be Developed for Joint Configuration Spaces of Multiple Robots Navigating on Planar Domains With Obstacles, Resulting in Complexity Reduction in Problems Involving Tethered Multi-robot Systems, Constrained Human-robot Teams, and Planning for Large Multi-agent Systems Without Coordination. Novel Algorithms for Efficient Computation of Homotopy Invariants in Spatial Domains Will Be Developed, Leading to Direct Amalgamation With Search-based Planning Algorithms With Application to Spatial Systems Involving Cables. the Project Goes Beyond Homotopy to Develop the Theoretical Foundations of a Deep Generalization to the Notion of Homotopy, Which Will Pave the Way for the Discovery and Computation of Novel Topological Constructions Called Reeb Structures That Are Suitable for Dimensionality Reduction of Configuration Spaces of Articulated and Soft Robotic Manipulators. All These Fundamental Advances Will Allow Development of Efficient Path Planning Algorithms With Completeness and Optimality Guarantees for High Degree-of-freedom Systems Such as Spatial, Multi-robot Systems & Human-robot Systems Involving One or More Flexible Cables; Coordination-free Multi-agent Systems; and Articulated Robotic Arms & Deformable Manipulators. the Developed Algorithms Will Be Implemented and Evaluated on Real Robotic Platforms. This Project Is Supported by the Cross-directorate Foundational Research in Robotics Program, Jointly Managed and Funded by the Directorates for Engineering (ENG) and Computer and Information Science and Engineering (cise). This Award Reflects NSF'S Statutory Mission and Has Been Deemed Worthy of Support Through Evaluation Using the Foundation's Intellectual Merit and Broader Impacts Review Criteria.
Committed
$500,246
Paid out
$294.6K
59%
Committed, not yet paid
$205.7K
41%
Loading…
Everything here is this single award's whole record — signed, amended, paid — not a fiscal-year slice. The by-year charts elsewhere split an award across the years it was committed; this page keeps it whole.
Committed is what the government has legally promised on this award so far. Contracts can also carry a ceiling — the maximum if every option is exercised. Unspent ceiling is headroom, not money owed.
The cash actually disbursed against this award. The gap from committed is the disbursement pipeline: promised, not yet cashed.
Each transaction is a signing event — an action that created or changed the award, dated the day it was signed — not a payment. Negative amounts are real: money de-committed at closeout or renegotiation.
One bar, the award’s whole arithmetic: paid out, then committed, not yet paid, then unspent ceiling.