2019 IEEE International Conference on Signal Processing, Communications and Computing (ICSPCC) 2019
DOI: 10.1109/icspcc46631.2019.8960790
|View full text |Cite
|
Sign up to set email alerts
|

Weighted Factor Graph aided Distributed Cooperative Position Algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
3
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(4 citation statements)
references
References 13 publications
0
4
0
Order By: Relevance
“…The network topology diagram is shown in Figure 1, which contains n m agents and p a anchors; a red link indicates that there is an obstacle between the anchor node and the agent, which is NLOS; a yellow link indicates a line-of-sight connection between the anchor and the agent; and a blue link indicates communication between the agents. The update mode of the belief information of each agent is the same in the proposed method [19]; therefore, this paper takes any agent q m in the network as an example. The In Figure 2, all nodes are considered to be variable nodes, j i t F  represents the function node from the neighbor node i to the agent j t , and the function node is used for data processing of positioning information.…”
Section: Factor-graph-aided Three-dimensional Faster Cooperative Positioning Algorithmmentioning
confidence: 99%
See 3 more Smart Citations
“…The network topology diagram is shown in Figure 1, which contains n m agents and p a anchors; a red link indicates that there is an obstacle between the anchor node and the agent, which is NLOS; a yellow link indicates a line-of-sight connection between the anchor and the agent; and a blue link indicates communication between the agents. The update mode of the belief information of each agent is the same in the proposed method [19]; therefore, this paper takes any agent q m in the network as an example. The In Figure 2, all nodes are considered to be variable nodes, j i t F  represents the function node from the neighbor node i to the agent j t , and the function node is used for data processing of positioning information.…”
Section: Factor-graph-aided Three-dimensional Faster Cooperative Positioning Algorithmmentioning
confidence: 99%
“…A solid line in the Figure 2 represents the belief information provided by the variable node to the function node, and a dotted line represents the position estimation information provided by the neighboring nodes to the target node [19][20][21]. Based on the calculation criteria of the sum-product algorithm, the paper uses belief information to iterate, transfer and solve in the factor graph, and then achieves the positioning of the target node.…”
Section: Factor-graph-aided Three-dimensional Faster Cooperative Positioning Algorithmmentioning
confidence: 99%
See 2 more Smart Citations