Bengt J. Nilsson

Malmö University, Lund University

Papers

4

Total Citations

45

H-Index

4

About

Bengt J. Nilsson is a Swedish computer scientist whose research lies at the intersection of computational geometry, online algorithms, and robotics. He is best known for his pioneering work on competitive exploration strategies, particularly for rectilinear polygons—a problem with direct applications to autonomous robot navigation and search-and-rescue operations. His 2005 paper on this topic, with 16 citations, remains a cornerstone in the field. Nilsson has also made significant contributions to parallel search theory, including his 2001 study on searching with multiple agents along m rays (13 citations), which explores how to minimize worst-case search time when multiple searchers collaborate. His 2006 work on the Online Freeze-Tag Problem (8 citations) addresses scheduling challenges in multi-robot systems, where one robot must awaken others to complete tasks efficiently. With a career spanning over two decades, Nilsson’s research has influenced both theoretical algorithm design and practical applications in robotics and distributed systems. His work is frequently cited by scholars studying competitive analysis, exploration algorithms, and online optimization.

Research Focus

Key Achievements

4
H-Index
4
Papers
45
Total Citations
11
Avg Citations/Paper
🏆 Most Cited Paper
Competitive exploration of rectilinear polygons
16 citations · 2005
📈 Most Prolific Year: 2005 (1 Papers)
🤝 Key Collaborators: 3
🏛 Institutions: Malmö University, Lund University

Top Papers

  1. 1
  2. 2
    Parallel searching on m rays
    13 citations · 2001
  3. 3
  4. 4
    Parallel Searching on m Rays
    8 citations · 1999

Key Collaborators

Contact & Links

Available for collaboration
Content generated · 15 days ago