scispace - formally typeset
A

Anu Pradhan

Researcher at Drexel University

Publications -  39
Citations -  652

Anu Pradhan is an academic researcher from Drexel University. The author has contributed to research in topics: Sensor fusion & Flow network. The author has an hindex of 13, co-authored 36 publications receiving 584 citations. Previous affiliations of Anu Pradhan include Carnegie Mellon University & University College Dublin.

Papers
More filters
Journal ArticleDOI

Technological Assessment of Radio Frequency Identification Technology for Indoor Localization

TL;DR: In this paper, the authors evaluated the feasibility of using radio frequency identification (RFID) to support indoor localization of a building component for repair to prevent any damage to a facility or its residents.
Journal ArticleDOI

Infrastructure Management Information System Framework Requirements for Disasters

TL;DR: This paper proposes an integrated, infrastructure management information system as a reliable and effective alternative and key resources in designing and implementing such an arrangement are prototyped in a system that was initially designed for addressing disaster management of urban explosions.
Proceedings ArticleDOI

Masonry Crack Detection Application of an Unmanned Aerial Vehicle

TL;DR: In this article, the authors discuss major challenges in automated crack detection and implementation on UAVs and discuss the use of image stitching to provide a comprehensive assessment of the health of the entire structure.
Journal ArticleDOI

Sensing and Field Data Capture for Construction and Facility Operations

TL;DR: In this article, the authors leverage the advancements in automated field data capture technologies to support decisions during construction and facility operations, which can be used not only for acquiring data about the various operations being carried out at construction sites but also for gathering information about the context surrounding these operations and monitoring the workflow of activities during these operations.
Journal ArticleDOI

Finding All-Pairs Shortest Path for a Large-Scale Transportation Network Using Parallel Floyd-Warshall and Parallel Dijkstra Algorithms

TL;DR: This paper describes parallel implementations and includes performance analyses of two prominent graph algorithms (i.e., Floyd-Warshall and Dijkstra) used to solve the shortest path problem in a transportation network.