An assortment of algorithms, termed three-dimensional (3D) scan-conversion is presented. These algorithms scan-convert 3D geometric objects into their discrete voxel-map representation within a Cubic Frame Buffer (CFB). The that are studied here include lines, polygons (optionally filled), polyhedra cubic parametric curves, bicubic surface patches, circles and quadratic filled) like those used in constructive solid geometry: cylinders, cones, spheres.

Conflict-Based Search (CBS) and its generalization, Meta-Agent CBS are amongst the strongest newly introduced algorithms for Multi-Agent Path Finding. This paper introduces ICBS, an improved version of CBS. ICBS incorporates three orthogonal improvements to which systematically described studied. Experimental results show that each these reduces runtime over basic by up 20x in many cases. When all combined, even larger improvement is achieved, producing state-ofthe art a number domains.

The novel technology of Distributed Acoustic Sensing (DAS) has gained widespread adoption over the last decade and is increasingly applied across various seismic applications. However, its use in Full-Waveform Inversion (FWI) remains limited. A key challenge utilizing surface DAS data for FWI lies heightened sensitivity DAS-measured strain to often highly heterogeneous near-surface compared traditional inertial measurements. This complicates recovery velocity model deeper regions, which are...

The directional nature of Distributed Acoustic Sensing (DAS) measurements can limit their usefulness for moment tensor estimation, which is traditionally inverted using multi-component sensors. However, we show that inversion DAS data acquired in a dual-well microseismic monitoring scenario yield reliable estimations all components. Our approach based on the adaptation linear waveform method, utilizing 3-D anisotropic viscoelastic Green's functions, to data. We estimate tensors 20 events...

Agents that plan and act in the real world must deal with fact time passes as they are planning. When timing is tight, there may be insufficient to complete search for a before it act. By commencing execution concludes, one gains by making planning concurrent. However, this incurs risk of incorrect action choices, especially if actions irreversible. This tradeoff between opportunity problem addressed paper. Our main contribution formally define setting an abstract metareasoning problem. We...

Abstract We investigate the resolvability of a microseismic event location given recording array composed vertical distributed acoustic sensing (DAS) boreholes. use modified source-scanning algorithm that takes into account both P and S waves. transform brightness maps it produces probability density functions (PDFs), over which we carry out resolution uncertainty analysis. apply this approach to events recorded by two DAS boreholes as part Frontier Observatory for Research in Geothermal...

Abstract Rayleigh waves are ubiquitously used for subsurface characterization through dispersion curve inversion, whose quality depends on the number of useable overtones. Traditional analysis is based vertical receivers and, active surveys, sources. However, layered media, eigenfunction theory shows that optimal recovery any given mode and frequency can be achieved by either source‐vertical receiver or radial source‐radial configurations, with source directivity being more dominant....

In online planning, search is concurrent with execution. Under the formulation of planning as heuristic search, when a planner commits to an action, it re-roots its tree at node representing outcome that action. For system remain controlled, must commit new action (perhaps no-op) before previously chosen completes. This time pressure results in real-time search. this time-bounded setting, can be beneficial early, order perform more lookahead focused below upcoming state. paper, we propose...

If a planning agent is considering taking bus, for example, the time that passes during its can affect feasibility of plans, as bus may depart before has found complete plan. Previous work on this situated temporal setting proposed an abstract deliberation scheduling scheme maximizing probability finding plan still feasible at it found. In paper, we extend approach to address problems in which plans differ their cost. Like deadlines, these costs be uncertain until been We show policy...

Abstract We develop and implement a modified source-scanning algorithm (SSA) method to estimate the absolute event locations in presence of velocity model errors, commonly found around fault zones. split array into subarrays clustered receivers, for which relative travel-time errors are smaller. apply conventional SSA using both P S waves each subarray combine estimations probabilistic scheme yield that robust errors. also compute uncertainty locations. 688 aftershocks recorded by 197...

Recent work on bidirectional search defined a lower bound costs of paths between pairs nodes, and introduced new algorithm, NBS, which is based this bound. Building these results, we introduce DVCBS, algorithm that aims to further reduce the number expansions. Generalizing beyond specific algorithms, then propose method for enhancing heuristics by propagating such bounds (lb-propagation) frontiers. This lb-propagation can be used in existing often improving their performance, as well making...

The longest simple path and snake-in-a-box are combinatorial search problems of considerable research interest. We create a common framework constrained in graph that contains these two problems, as well other interesting maximum special cases. analyze properties this general framework, produce bounds on the length can be used admissible heuristics for all problem types therein. For cases snakes, shown to reduce number expansions when searching maximal path, which some leads reduced time...

There has been much recent work on finding paths in grid maps among moving obstacles. However, addition to assuming complete omniscience regarding the map and obstacles' trajectories, previous also assumed that time stands still while agent plans. In this paper, we address situated pathfinding, which passes obstacles continue move We study choice of state space representation search algorithm, with a focus whether conclusions drawn from studies off-line case hold setting.

Abstract Sample preparation techniques for electron-microscopy (EM) dictate our perception of the microworld: any structural information which is lost or distorted during can not be regenerated later and might lead to wrong interpretation observed micrograph. Cryofixation based procedures specimen avoid most alterations associated with standard on chemical fixation. The ultrastructure represented in a near “native state” thanks high time resolution dynamic cellular events (1). High pressure...