Evidence map›Paper›PMID 36236396›Full record

ArticleSensors (Basel, Switzerland)2022

Application of Heuristic Algorithms in the Tomography Problem for Pre-Mining Anomaly Detection in Coal Seams.

Rafał Brociek, Mariusz Pleszczyński, Adam Zielonka, Agata Wajda, Salvatore Coco, Grazia Lo Sciuto, Christian Napoli

Abstract read
In one paragraph

Article in Sensors (Basel, Switzerland), 2022. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 3 papers.

0numbers the graph read from it
0cells of the map it votes in
3citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

3 citing papers in PubMed.

  1. Article
  2. Article
  3. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

7 authors.

Rafał BrociekDepartment of Mathematics Applications and Methods for Artificial Intelligence, Faculty of Applied Mathematics, Silesian University of Technology, 44-100 Gliwice, Poland.ORCID 0000-0002-7255-6951
Mariusz PleszczyńskiDepartment of Mathematics Applications and Methods for Artificial Intelligence, Faculty of Applied Mathematics, Silesian University of Technology, 44-100 Gliwice, Poland.ORCID 0000-0002-4971-5360
Adam ZielonkaDepartment of Mathematics Applications and Methods for Artificial Intelligence, Faculty of Applied Mathematics, Silesian University of Technology, 44-100 Gliwice, Poland.ORCID 0000-0002-3850-8577
Agata WajdaInstitute of Energy and Fuel Processing Technology, 41-803 Zabrze, Poland.ORCID 0000-0002-1667-3328
Salvatore CocoDepartment of Electrical, Electronics and Informatics Engineering, University of Catania, Viale Andrea Doria, 6, 95125 Catania, Italy.ORCID 0000-0002-8463-5075
Grazia Lo SciutoDepartment of Electrical, Electronics and Informatics Engineering, University of Catania, Viale Andrea Doria, 6, 95125 Catania, Italy.ORCID 0000-0001-9384-7232
Christian NapoliDepartment of Computer, Control, and Management Engineering, Sapienza University of Rome, Via Ariosto 25, 00185 Roma, Italy.ORCID 0000-0002-3336-5853

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

The paper presents research on a specific approach to the issue of computed tomography with an incomplete data set. The case of incomplete information is quite common, for example when examining objects of large size or difficult to access. Algorithms devoted to this type of problems can be used to detect anomalies in coal seams that pose a threat to the life of miners. The most dangerous example of such an anomaly may be a compressed gas tank, which expands rapidly during exploitation, at the same time ejecting rock fragments, which are a real threat to the working crew. The approach presented in the paper is an improvement of the previous idea, in which the detected objects were represented by sequences of points. These points represent rectangles, which were characterized by sequences of their parameters. This time, instead of sequences in the representation, there are sets of objects, which allow for the elimination of duplicates. As a result, the reconstruction is faster. The algorithm presented in the paper solves the inverse problem of finding the minimum of the objective function. Heuristic algorithms are suitable for solving this type of tasks. The following heuristic algorithms are described, tested and compared: Aquila Optimizer (AQ), Firefly Algorithm (FA), Whale Optimization Algorithm (WOA), Butterfly Optimization Algorithm (BOA) and Dynamic Butterfly Optimization Algorithm (DBOA). The research showed that the best algorithm for this type of problem turned out to be DBOA.

Indexed as

CoalHeuristicsAlgorithmsTomography, X-Ray ComputedCoalcomputed tomographyincomplete data setinverse problemoptimization

Identifiers

PMID36236396
PMCPMC9572328

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.