John Franco

University of Cincinnati

Papers

3

Total Citations

299

H-Index

3

About

John Franco’s research career spans two seemingly distinct but computationally foundational domains: the satisfiability (SAT) problem and robot navigation. His most impactful contribution is the landmark survey "Algorithms for the satisfiability (SAT) problem: A survey" (1997), which has garnered 287 citations. This work remains a critical resource for researchers in automated reasoning, computer-aided design, and machine vision, synthesizing decades of algorithmic progress on a core problem in mathematical logic and computing theory. In the field of robotics, Franco contributed to the development of incremental replanning algorithms, notably through his work on D* Lite. His 2002 paper "Avoiding Unnecessary Calculations in Robot Navigation" and the 2011 "ID* Lite" (8 citations) address the challenge of efficient path planning in unknown or dynamic environments, building upon one of the most functional algorithms in the domain. While his SAT survey defines his legacy in terms of citation impact, his robotics work demonstrates a versatility in tackling complex, real-world computational problems. Franco’s career illustrates how deep theoretical understanding can be applied across diverse problem spaces, from logic to autonomous systems.

Research Focus

Key Achievements

3
H-Index
3
Papers
299
Total Citations
100
Avg Citations/Paper
🏆 Most Cited Paper
Algorithms for the satisfiability (SAT) problem: A survey
287 citations · 1997
📈 Most Prolific Year: 1997 (1 Papers)
🤝 Key Collaborators: 6
🏛 Institutions: University of Cincinnati

Top Papers

  1. 1
  2. 2
    ID* Lite
    8 citations · 2011
  3. 3

Key Collaborators

Contact & Links

Available for collaboration
Content generated · 13 days ago